./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_swap_contents_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/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_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_swap_contents_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/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_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/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 fab5c58d108ab0116c19af669265df6088034967e28562e9e7d2713e6ada683d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:55:24,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:55:24,562 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-29 03:55:24,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:55:24,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:55:24,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:55:24,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:55:24,587 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:55:24,588 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:55:24,589 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:55:24,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:55:24,590 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:55:24,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:55:24,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:55:24,591 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:55:24,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:55:24,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:55:24,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:55:24,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:55:24,594 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:55:24,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:55:24,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:55:24,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:55:24,596 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:55:24,596 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:55:24,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:55:24,597 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:55:24,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:55:24,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:55:24,598 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:55:24,599 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:55:24,599 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:55:24,599 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:55:24,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:55:24,600 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:55:24,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:55:24,600 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:55:24,600 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:55:24,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:55:24,601 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_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/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_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/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 -> fab5c58d108ab0116c19af669265df6088034967e28562e9e7d2713e6ada683d [2023-11-29 03:55:24,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:55:24,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:55:24,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:55:24,851 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:55:24,852 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:55:24,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/aws-c-common/aws_linked_list_swap_contents_harness.i [2023-11-29 03:55:27,571 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:55:27,981 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:55:27,981 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/sv-benchmarks/c/aws-c-common/aws_linked_list_swap_contents_harness.i [2023-11-29 03:55:28,009 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/data/c97adef6b/472747aa5cc345fb82dd9ee6c2723639/FLAG1335fd1f6 [2023-11-29 03:55:28,023 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/data/c97adef6b/472747aa5cc345fb82dd9ee6c2723639 [2023-11-29 03:55:28,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:55:28,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:55:28,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:55:28,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:55:28,033 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:55:28,034 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:55:28" (1/1) ... [2023-11-29 03:55:28,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@643f46bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:55:28, skipping insertion in model container [2023-11-29 03:55:28,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:55:28" (1/1) ... [2023-11-29 03:55:28,123 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:55:28,321 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_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/sv-benchmarks/c/aws-c-common/aws_linked_list_swap_contents_harness.i[4503,4516] [2023-11-29 03:55:28,327 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_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/sv-benchmarks/c/aws-c-common/aws_linked_list_swap_contents_harness.i[4563,4576] [2023-11-29 03:55:29,060 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,061 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,062 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,063 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,064 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,079 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,079 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,081 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,082 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,084 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,085 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,086 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,086 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,432 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-29 03:55:29,433 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-29 03:55:29,435 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-29 03:55:29,436 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-29 03:55:29,438 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-29 03:55:29,438 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-29 03:55:29,439 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-29 03:55:29,440 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-29 03:55:29,440 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-29 03:55:29,441 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-29 03:55:29,607 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:55:29,623 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:55:29,637 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_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/sv-benchmarks/c/aws-c-common/aws_linked_list_swap_contents_harness.i[4503,4516] [2023-11-29 03:55:29,637 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_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/sv-benchmarks/c/aws-c-common/aws_linked_list_swap_contents_harness.i[4563,4576] [2023-11-29 03:55:29,697 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,698 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,698 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,699 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,699 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,709 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,709 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,710 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,711 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,712 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,712 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,713 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,713 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:55:29,747 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-29 03:55:29,748 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-29 03:55:29,748 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-29 03:55:29,749 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-29 03:55:29,750 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-29 03:55:29,751 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-29 03:55:29,751 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-29 03:55:29,752 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-29 03:55:29,753 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-29 03:55:29,753 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-29 03:55:29,790 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:55:30,006 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:55:30,006 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:55:30,006 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:55:30,006 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:55:30,006 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:55:30,007 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:55:30,007 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:55:30,007 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:55:30,007 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:55:30,007 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:55:30,008 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:55:30,008 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:55:30,008 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:55:30,008 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:55:30,008 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:55:30,009 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:55:30,016 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:55:30,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:55:30 WrapperNode [2023-11-29 03:55:30,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:55:30,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:55:30,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:55:30,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:55:30,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:55:30" (1/1) ... [2023-11-29 03:55:30,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:55:30" (1/1) ... [2023-11-29 03:55:30,128 INFO L138 Inliner]: procedures = 678, calls = 1080, calls flagged for inlining = 51, calls inlined = 5, statements flattened = 212 [2023-11-29 03:55:30,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:55:30,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:55:30,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:55:30,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:55:30,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:55:30" (1/1) ... [2023-11-29 03:55:30,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:55:30" (1/1) ... [2023-11-29 03:55:30,144 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:55:30" (1/1) ... [2023-11-29 03:55:30,172 INFO L175 MemorySlicer]: Split 68 memory accesses to 5 slices as follows [2, 47, 5, 7, 7]. 69 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 0, 5, 4, 4]. The 18 writes are split as follows [0, 18, 0, 0, 0]. [2023-11-29 03:55:30,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:55:30" (1/1) ... [2023-11-29 03:55:30,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:55:30" (1/1) ... [2023-11-29 03:55:30,193 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:55:30" (1/1) ... [2023-11-29 03:55:30,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:55:30" (1/1) ... [2023-11-29 03:55:30,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:55:30" (1/1) ... [2023-11-29 03:55:30,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:55:30" (1/1) ... [2023-11-29 03:55:30,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:55:30,217 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:55:30,217 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:55:30,217 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:55:30,218 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:55:30" (1/1) ... [2023-11-29 03:55:30,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:55:30,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:55:30,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:55:30,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:55:30,288 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_init [2023-11-29 03:55:30,289 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_init [2023-11-29 03:55:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:55:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 03:55:30,289 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 03:55:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-29 03:55:30,289 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-29 03:55:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_linked_list_is_allocated [2023-11-29 03:55:30,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_linked_list_is_allocated [2023-11-29 03:55:30,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 03:55:30,290 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-29 03:55:30,290 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-29 03:55:30,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:55:30,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 03:55:30,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 03:55:30,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 03:55:30,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 03:55:30,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-29 03:55:30,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:55:30,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:55:30,291 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2023-11-29 03:55:30,291 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2023-11-29 03:55:30,291 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 03:55:30,292 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 03:55:30,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 03:55:30,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 03:55:30,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 03:55:30,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 03:55:30,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 03:55:30,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-29 03:55:30,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 03:55:30,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 03:55:30,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 03:55:30,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-29 03:55:30,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-29 03:55:30,293 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-29 03:55:30,293 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-29 03:55:30,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:55:30,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 03:55:30,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 03:55:30,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 03:55:30,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 03:55:30,537 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:55:30,539 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:55:30,856 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:55:30,892 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:55:30,892 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 03:55:30,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:55:30 BoogieIcfgContainer [2023-11-29 03:55:30,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:55:30,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:55:30,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:55:30,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:55:30,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:55:28" (1/3) ... [2023-11-29 03:55:30,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fbad0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:55:30, skipping insertion in model container [2023-11-29 03:55:30,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:55:30" (2/3) ... [2023-11-29 03:55:30,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fbad0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:55:30, skipping insertion in model container [2023-11-29 03:55:30,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:55:30" (3/3) ... [2023-11-29 03:55:30,902 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_swap_contents_harness.i [2023-11-29 03:55:30,920 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:55:30,920 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:55:30,973 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:55:30,979 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;@1702272f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:55:30,980 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:55:30,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 62 states have internal predecessors, (80), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-29 03:55:30,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-29 03:55:30,998 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:55:30,999 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 03:55:31,000 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:55:31,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:55:31,005 INFO L85 PathProgramCache]: Analyzing trace with hash -368461878, now seen corresponding path program 1 times [2023-11-29 03:55:31,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:55:31,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136527407] [2023-11-29 03:55:31,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:31,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:55:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:55:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 03:55:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:55:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 03:55:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 03:55:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 03:55:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 03:55:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:31,666 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 03:55:31,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:55:31,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136527407] [2023-11-29 03:55:31,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136527407] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:55:31,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749286122] [2023-11-29 03:55:31,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:31,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:31,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:55:31,670 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:55:31,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 03:55:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:32,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 03:55:32,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:55:32,054 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-11-29 03:55:32,054 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:55:32,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749286122] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:55:32,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:55:32,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2023-11-29 03:55:32,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147074924] [2023-11-29 03:55:32,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:55:32,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 03:55:32,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:55:32,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 03:55:32,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:55:32,086 INFO L87 Difference]: Start difference. First operand has 103 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 62 states have internal predecessors, (80), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 03:55:32,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:55:32,143 INFO L93 Difference]: Finished difference Result 204 states and 325 transitions. [2023-11-29 03:55:32,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 03:55:32,146 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 95 [2023-11-29 03:55:32,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:55:32,155 INFO L225 Difference]: With dead ends: 204 [2023-11-29 03:55:32,155 INFO L226 Difference]: Without dead ends: 99 [2023-11-29 03:55:32,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 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 03:55:32,164 INFO L413 NwaCegarLoop]: 135 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, 135 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 03:55:32,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:55:32,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-29 03:55:32,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-29 03:55:32,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 60 states have internal predecessors, (73), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 03:55:32,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2023-11-29 03:55:32,211 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 95 [2023-11-29 03:55:32,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:55:32,212 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2023-11-29 03:55:32,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 03:55:32,212 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2023-11-29 03:55:32,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-29 03:55:32,217 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:55:32,218 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 03:55:32,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:55:32,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-29 03:55:32,420 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:55:32,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:55:32,420 INFO L85 PathProgramCache]: Analyzing trace with hash -118777200, now seen corresponding path program 1 times [2023-11-29 03:55:32,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:55:32,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305128523] [2023-11-29 03:55:32,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:32,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:55:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:32,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:32,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:32,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:32,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:55:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:32,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:32,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:32,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 03:55:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:32,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:55:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:32,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 03:55:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:32,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 03:55:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:32,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 03:55:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:32,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:32,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 03:55:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:32,891 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 03:55:32,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:55:32,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305128523] [2023-11-29 03:55:32,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305128523] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:55:32,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339954689] [2023-11-29 03:55:32,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:32,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:32,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:55:32,895 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:55:32,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 03:55:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:33,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:55:33,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:55:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-11-29 03:55:33,269 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:55:33,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339954689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:55:33,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:55:33,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2023-11-29 03:55:33,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891091607] [2023-11-29 03:55:33,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:55:33,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:55:33,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:55:33,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:55:33,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:55:33,273 INFO L87 Difference]: Start difference. First operand 99 states and 139 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-29 03:55:33,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:55:33,356 INFO L93 Difference]: Finished difference Result 195 states and 287 transitions. [2023-11-29 03:55:33,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:55:33,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 95 [2023-11-29 03:55:33,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:55:33,360 INFO L225 Difference]: With dead ends: 195 [2023-11-29 03:55:33,360 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 03:55:33,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:55:33,364 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 21 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:55:33,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 383 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:55:33,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 03:55:33,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 101. [2023-11-29 03:55:33,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 58 states have (on average 1.293103448275862) internal successors, (75), 62 states have internal predecessors, (75), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 03:55:33,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2023-11-29 03:55:33,382 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 95 [2023-11-29 03:55:33,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:55:33,384 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2023-11-29 03:55:33,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-29 03:55:33,384 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2023-11-29 03:55:33,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-29 03:55:33,386 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:55:33,386 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 03:55:33,394 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 03:55:33,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:33,591 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:55:33,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:55:33,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1123734738, now seen corresponding path program 1 times [2023-11-29 03:55:33,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:55:33,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887887626] [2023-11-29 03:55:33,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:33,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:55:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:33,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:33,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:33,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:33,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:55:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:33,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:33,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:33,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 03:55:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:33,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:55:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:33,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 03:55:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:34,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 03:55:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:34,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 03:55:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:34,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:34,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 03:55:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:34,035 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-11-29 03:55:34,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:55:34,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887887626] [2023-11-29 03:55:34,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887887626] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:55:34,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759002761] [2023-11-29 03:55:34,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:34,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:34,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:55:34,039 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:55:34,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 03:55:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:34,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:55:34,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:55:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-11-29 03:55:34,393 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:55:34,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759002761] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:55:34,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:55:34,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2023-11-29 03:55:34,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157554070] [2023-11-29 03:55:34,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:55:34,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:55:34,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:55:34,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:55:34,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:55:34,395 INFO L87 Difference]: Start difference. First operand 101 states and 141 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-29 03:55:34,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:55:34,473 INFO L93 Difference]: Finished difference Result 195 states and 285 transitions. [2023-11-29 03:55:34,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:55:34,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 95 [2023-11-29 03:55:34,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:55:34,476 INFO L225 Difference]: With dead ends: 195 [2023-11-29 03:55:34,476 INFO L226 Difference]: Without dead ends: 109 [2023-11-29 03:55:34,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:55:34,478 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 12 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:55:34,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 380 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:55:34,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-29 03:55:34,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2023-11-29 03:55:34,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 64 states have internal predecessors, (77), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 03:55:34,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 143 transitions. [2023-11-29 03:55:34,491 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 143 transitions. Word has length 95 [2023-11-29 03:55:34,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:55:34,492 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 143 transitions. [2023-11-29 03:55:34,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-29 03:55:34,492 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 143 transitions. [2023-11-29 03:55:34,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-29 03:55:34,494 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:55:34,494 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 03:55:34,501 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 03:55:34,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-29 03:55:34,701 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:55:34,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:55:34,702 INFO L85 PathProgramCache]: Analyzing trace with hash 146257812, now seen corresponding path program 1 times [2023-11-29 03:55:34,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:55:34,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79081199] [2023-11-29 03:55:34,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:34,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:55:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:34,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:35,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:35,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:35,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:55:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:35,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:35,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:35,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 03:55:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:35,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:55:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:35,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 03:55:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:35,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 03:55:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:35,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 03:55:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:35,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:35,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 03:55:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:35,172 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-11-29 03:55:35,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:55:35,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79081199] [2023-11-29 03:55:35,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79081199] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:55:35,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970809366] [2023-11-29 03:55:35,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:35,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:35,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:55:35,175 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:55:35,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 03:55:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:35,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:55:35,521 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:55:35,531 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-29 03:55:35,531 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:55:35,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970809366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:55:35,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:55:35,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2023-11-29 03:55:35,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224276646] [2023-11-29 03:55:35,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:55:35,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:55:35,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:55:35,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:55:35,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:55:35,534 INFO L87 Difference]: Start difference. First operand 103 states and 143 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-29 03:55:35,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:55:35,599 INFO L93 Difference]: Finished difference Result 195 states and 283 transitions. [2023-11-29 03:55:35,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:55:35,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 95 [2023-11-29 03:55:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:55:35,601 INFO L225 Difference]: With dead ends: 195 [2023-11-29 03:55:35,602 INFO L226 Difference]: Without dead ends: 107 [2023-11-29 03:55:35,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:55:35,604 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 3 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:55:35,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 379 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:55:35,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-29 03:55:35,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2023-11-29 03:55:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 67 states have internal predecessors, (80), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 03:55:35,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 146 transitions. [2023-11-29 03:55:35,616 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 146 transitions. Word has length 95 [2023-11-29 03:55:35,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:55:35,617 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 146 transitions. [2023-11-29 03:55:35,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-29 03:55:35,617 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 146 transitions. [2023-11-29 03:55:35,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-29 03:55:35,619 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:55:35,619 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 03:55:35,626 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 03:55:35,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:35,826 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:55:35,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:55:35,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1383228118, now seen corresponding path program 1 times [2023-11-29 03:55:35,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:55:35,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917184927] [2023-11-29 03:55:35,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:35,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:55:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:36,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:36,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:36,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:36,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:55:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:36,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:36,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:36,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 03:55:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:36,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:55:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:36,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 03:55:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:36,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 03:55:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:36,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 03:55:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:36,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:36,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 03:55:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:36,325 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-29 03:55:36,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:55:36,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917184927] [2023-11-29 03:55:36,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917184927] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:55:36,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975504140] [2023-11-29 03:55:36,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:36,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:36,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:55:36,327 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:55:36,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 03:55:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:36,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 03:55:36,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:55:36,800 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-29 03:55:36,801 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:55:36,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975504140] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:55:36,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:55:36,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2023-11-29 03:55:36,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544181757] [2023-11-29 03:55:36,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:55:36,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:55:36,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:55:36,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:55:36,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:55:36,803 INFO L87 Difference]: Start difference. First operand 106 states and 146 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 03:55:36,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:55:36,987 INFO L93 Difference]: Finished difference Result 204 states and 286 transitions. [2023-11-29 03:55:36,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:55:36,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 95 [2023-11-29 03:55:36,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:55:36,991 INFO L225 Difference]: With dead ends: 204 [2023-11-29 03:55:36,991 INFO L226 Difference]: Without dead ends: 113 [2023-11-29 03:55:36,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:55:36,993 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 26 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:55:36,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 418 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:55:36,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-29 03:55:37,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-11-29 03:55:37,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 74 states have internal predecessors, (86), 34 states have call successors, (34), 8 states have call predecessors, (34), 9 states have return successors, (36), 32 states have call predecessors, (36), 32 states have call successors, (36) [2023-11-29 03:55:37,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 156 transitions. [2023-11-29 03:55:37,008 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 156 transitions. Word has length 95 [2023-11-29 03:55:37,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:55:37,008 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 156 transitions. [2023-11-29 03:55:37,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 03:55:37,009 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 156 transitions. [2023-11-29 03:55:37,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-29 03:55:37,010 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:55:37,010 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 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 03:55:37,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 03:55:37,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:37,213 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:55:37,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:55:37,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1831423530, now seen corresponding path program 1 times [2023-11-29 03:55:37,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:55:37,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945990365] [2023-11-29 03:55:37,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:37,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:55:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:37,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:37,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:37,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:37,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:55:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:37,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:37,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:37,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 03:55:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:37,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:55:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:37,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 03:55:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:37,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 03:55:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:37,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 03:55:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:37,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:37,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 03:55:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-29 03:55:37,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:55:37,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945990365] [2023-11-29 03:55:37,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945990365] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:55:37,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637440891] [2023-11-29 03:55:37,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:37,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:37,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:55:37,578 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:55:37,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 03:55:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:37,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 03:55:38,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:55:38,103 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-29 03:55:38,103 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:55:38,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637440891] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:55:38,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:55:38,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2023-11-29 03:55:38,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435504254] [2023-11-29 03:55:38,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:55:38,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:55:38,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:55:38,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:55:38,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:55:38,106 INFO L87 Difference]: Start difference. First operand 113 states and 156 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 03:55:38,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:55:38,294 INFO L93 Difference]: Finished difference Result 208 states and 287 transitions. [2023-11-29 03:55:38,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:55:38,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 95 [2023-11-29 03:55:38,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:55:38,297 INFO L225 Difference]: With dead ends: 208 [2023-11-29 03:55:38,297 INFO L226 Difference]: Without dead ends: 113 [2023-11-29 03:55:38,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:55:38,298 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 25 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:55:38,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 544 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:55:38,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-29 03:55:38,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-11-29 03:55:38,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 74 states have internal predecessors, (86), 34 states have call successors, (34), 8 states have call predecessors, (34), 9 states have return successors, (33), 32 states have call predecessors, (33), 32 states have call successors, (33) [2023-11-29 03:55:38,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 153 transitions. [2023-11-29 03:55:38,312 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 153 transitions. Word has length 95 [2023-11-29 03:55:38,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:55:38,313 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 153 transitions. [2023-11-29 03:55:38,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 03:55:38,313 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 153 transitions. [2023-11-29 03:55:38,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-29 03:55:38,315 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:55:38,315 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 03:55:38,321 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 03:55:38,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:38,516 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:55:38,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:55:38,516 INFO L85 PathProgramCache]: Analyzing trace with hash -171841330, now seen corresponding path program 1 times [2023-11-29 03:55:38,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:55:38,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421416707] [2023-11-29 03:55:38,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:38,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:55:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:38,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:38,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:38,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:38,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:55:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:38,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:38,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:38,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 03:55:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:38,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:55:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:39,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 03:55:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:39,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 03:55:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:39,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 03:55:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:39,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:39,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 03:55:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:39,061 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-11-29 03:55:39,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:55:39,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421416707] [2023-11-29 03:55:39,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421416707] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:55:39,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684586887] [2023-11-29 03:55:39,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:39,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:39,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:55:39,063 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:55:39,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 03:55:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:39,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-29 03:55:39,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:55:39,564 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-29 03:55:39,564 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:55:39,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684586887] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:55:39,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:55:39,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 11 [2023-11-29 03:55:39,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488988853] [2023-11-29 03:55:39,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:55:39,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:55:39,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:55:39,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:55:39,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:55:39,566 INFO L87 Difference]: Start difference. First operand 113 states and 153 transitions. Second operand has 8 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2023-11-29 03:55:39,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:55:39,877 INFO L93 Difference]: Finished difference Result 213 states and 295 transitions. [2023-11-29 03:55:39,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:55:39,877 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 95 [2023-11-29 03:55:39,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:55:39,879 INFO L225 Difference]: With dead ends: 213 [2023-11-29 03:55:39,879 INFO L226 Difference]: Without dead ends: 115 [2023-11-29 03:55:39,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-11-29 03:55:39,881 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 28 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:55:39,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 766 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:55:39,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-29 03:55:39,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-11-29 03:55:39,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 76 states have internal predecessors, (87), 34 states have call successors, (34), 8 states have call predecessors, (34), 10 states have return successors, (39), 32 states have call predecessors, (39), 32 states have call successors, (39) [2023-11-29 03:55:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 160 transitions. [2023-11-29 03:55:39,896 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 160 transitions. Word has length 95 [2023-11-29 03:55:39,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:55:39,896 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 160 transitions. [2023-11-29 03:55:39,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2023-11-29 03:55:39,897 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 160 transitions. [2023-11-29 03:55:39,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-29 03:55:39,898 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:55:39,898 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 03:55:39,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 03:55:40,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:40,099 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:55:40,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:55:40,099 INFO L85 PathProgramCache]: Analyzing trace with hash 728474642, now seen corresponding path program 1 times [2023-11-29 03:55:40,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:55:40,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562936324] [2023-11-29 03:55:40,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:40,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:55:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:40,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:40,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:40,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:40,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:55:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:40,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:40,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:40,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 03:55:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:40,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 03:55:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:40,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 03:55:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:40,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 03:55:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:40,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 03:55:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:40,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:40,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 03:55:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:40,511 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-29 03:55:40,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:55:40,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562936324] [2023-11-29 03:55:40,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562936324] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:55:40,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538420545] [2023-11-29 03:55:40,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:40,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:40,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:55:40,513 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:55:40,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 03:55:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:40,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 03:55:40,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:55:41,019 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-29 03:55:41,019 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:55:41,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538420545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:55:41,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:55:41,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2023-11-29 03:55:41,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978328370] [2023-11-29 03:55:41,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:55:41,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:55:41,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:55:41,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:55:41,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:55:41,022 INFO L87 Difference]: Start difference. First operand 115 states and 160 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 03:55:41,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:55:41,330 INFO L93 Difference]: Finished difference Result 218 states and 310 transitions. [2023-11-29 03:55:41,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:55:41,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 97 [2023-11-29 03:55:41,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:55:41,332 INFO L225 Difference]: With dead ends: 218 [2023-11-29 03:55:41,332 INFO L226 Difference]: Without dead ends: 118 [2023-11-29 03:55:41,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:55:41,334 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 53 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:55:41,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 566 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:55:41,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-29 03:55:41,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-11-29 03:55:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 79 states have internal predecessors, (89), 34 states have call successors, (34), 8 states have call predecessors, (34), 11 states have return successors, (43), 32 states have call predecessors, (43), 32 states have call successors, (43) [2023-11-29 03:55:41,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2023-11-29 03:55:41,347 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 97 [2023-11-29 03:55:41,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:55:41,347 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2023-11-29 03:55:41,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 03:55:41,347 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2023-11-29 03:55:41,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-29 03:55:41,348 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:55:41,349 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 03:55:41,355 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 03:55:41,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-29 03:55:41,551 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:55:41,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:55:41,551 INFO L85 PathProgramCache]: Analyzing trace with hash 722374213, now seen corresponding path program 1 times [2023-11-29 03:55:41,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:55:41,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527370147] [2023-11-29 03:55:41,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:41,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:55:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:41,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:41,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:41,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:41,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:55:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:41,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:41,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:41,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 03:55:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:41,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 03:55:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:41,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 03:55:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:41,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 03:55:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:41,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 03:55:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:41,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:41,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:55:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:41,907 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-29 03:55:41,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:55:41,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527370147] [2023-11-29 03:55:41,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527370147] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:55:41,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623219250] [2023-11-29 03:55:41,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:41,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:41,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:55:41,909 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:55:41,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 03:55:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:42,391 INFO L262 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 03:55:42,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:55:42,491 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-29 03:55:42,492 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:55:42,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623219250] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:55:42,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:55:42,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2023-11-29 03:55:42,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727241249] [2023-11-29 03:55:42,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:55:42,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:55:42,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:55:42,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:55:42,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2023-11-29 03:55:42,495 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 03:55:42,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:55:42,858 INFO L93 Difference]: Finished difference Result 231 states and 333 transitions. [2023-11-29 03:55:42,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:55:42,859 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 99 [2023-11-29 03:55:42,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:55:42,860 INFO L225 Difference]: With dead ends: 231 [2023-11-29 03:55:42,861 INFO L226 Difference]: Without dead ends: 128 [2023-11-29 03:55:42,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2023-11-29 03:55:42,862 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 77 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:55:42,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 654 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:55:42,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-29 03:55:42,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2023-11-29 03:55:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 81 states have internal predecessors, (92), 34 states have call successors, (34), 8 states have call predecessors, (34), 11 states have return successors, (43), 32 states have call predecessors, (43), 32 states have call successors, (43) [2023-11-29 03:55:42,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 169 transitions. [2023-11-29 03:55:42,875 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 169 transitions. Word has length 99 [2023-11-29 03:55:42,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:55:42,876 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 169 transitions. [2023-11-29 03:55:42,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 03:55:42,876 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 169 transitions. [2023-11-29 03:55:42,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-29 03:55:42,877 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:55:42,878 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 03:55:42,885 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 03:55:43,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:43,083 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:55:43,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:55:43,083 INFO L85 PathProgramCache]: Analyzing trace with hash 453698197, now seen corresponding path program 1 times [2023-11-29 03:55:43,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:55:43,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376942370] [2023-11-29 03:55:43,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:43,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:55:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:43,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:43,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:43,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:43,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:55:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:43,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:43,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:43,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 03:55:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:43,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 03:55:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:43,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 03:55:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:43,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 03:55:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:43,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 03:55:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:43,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:43,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 03:55:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:43,571 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-11-29 03:55:43,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:55:43,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376942370] [2023-11-29 03:55:43,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376942370] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:55:43,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371431998] [2023-11-29 03:55:43,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:43,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:43,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:55:43,573 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:55:43,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 03:55:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:44,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:55:44,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:55:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-29 03:55:44,030 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:55:44,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371431998] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:55:44,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:55:44,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 03:55:44,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181766996] [2023-11-29 03:55:44,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:55:44,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:55:44,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:55:44,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:55:44,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:55:44,032 INFO L87 Difference]: Start difference. First operand 120 states and 169 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-29 03:55:44,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:55:44,078 INFO L93 Difference]: Finished difference Result 230 states and 336 transitions. [2023-11-29 03:55:44,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:55:44,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2023-11-29 03:55:44,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:55:44,080 INFO L225 Difference]: With dead ends: 230 [2023-11-29 03:55:44,080 INFO L226 Difference]: Without dead ends: 125 [2023-11-29 03:55:44,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 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 03:55:44,082 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 4 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:55:44,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 250 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:55:44,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-29 03:55:44,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2023-11-29 03:55:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 75 states have (on average 1.24) internal successors, (93), 82 states have internal predecessors, (93), 34 states have call successors, (34), 8 states have call predecessors, (34), 11 states have return successors, (43), 32 states have call predecessors, (43), 32 states have call successors, (43) [2023-11-29 03:55:44,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 170 transitions. [2023-11-29 03:55:44,094 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 170 transitions. Word has length 100 [2023-11-29 03:55:44,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:55:44,095 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 170 transitions. [2023-11-29 03:55:44,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-29 03:55:44,095 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 170 transitions. [2023-11-29 03:55:44,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 03:55:44,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:55:44,097 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 03:55:44,103 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 03:55:44,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:44,297 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:55:44,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:55:44,298 INFO L85 PathProgramCache]: Analyzing trace with hash -223574809, now seen corresponding path program 1 times [2023-11-29 03:55:44,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:55:44,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703144139] [2023-11-29 03:55:44,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:44,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:55:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:44,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:44,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:44,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:44,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:55:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:44,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:44,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:44,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 03:55:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:44,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:55:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:44,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 03:55:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:44,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 03:55:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:44,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 03:55:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:44,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:55:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:44,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:44,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 03:55:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:44,680 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-11-29 03:55:44,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:55:44,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703144139] [2023-11-29 03:55:44,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703144139] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:55:44,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119649649] [2023-11-29 03:55:44,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:44,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:44,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:55:44,682 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:55:44,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 03:55:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:45,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:55:45,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:55:45,181 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-29 03:55:45,182 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:55:45,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119649649] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:55:45,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:55:45,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2023-11-29 03:55:45,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539705353] [2023-11-29 03:55:45,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:55:45,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:55:45,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:55:45,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:55:45,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:55:45,183 INFO L87 Difference]: Start difference. First operand 121 states and 170 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 03:55:45,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:55:45,229 INFO L93 Difference]: Finished difference Result 231 states and 336 transitions. [2023-11-29 03:55:45,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:55:45,230 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2023-11-29 03:55:45,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:55:45,232 INFO L225 Difference]: With dead ends: 231 [2023-11-29 03:55:45,232 INFO L226 Difference]: Without dead ends: 125 [2023-11-29 03:55:45,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:55:45,234 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 3 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:55:45,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 384 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:55:45,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-29 03:55:45,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2023-11-29 03:55:45,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 84 states have internal predecessors, (95), 34 states have call successors, (34), 8 states have call predecessors, (34), 11 states have return successors, (43), 32 states have call predecessors, (43), 32 states have call successors, (43) [2023-11-29 03:55:45,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 172 transitions. [2023-11-29 03:55:45,245 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 172 transitions. Word has length 107 [2023-11-29 03:55:45,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:55:45,245 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 172 transitions. [2023-11-29 03:55:45,246 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 03:55:45,246 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 172 transitions. [2023-11-29 03:55:45,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 03:55:45,247 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:55:45,247 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 03:55:45,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 03:55:45,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:45,448 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:55:45,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:55:45,448 INFO L85 PathProgramCache]: Analyzing trace with hash 210154277, now seen corresponding path program 1 times [2023-11-29 03:55:45,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:55:45,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201707629] [2023-11-29 03:55:45,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:45,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:55:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:45,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:45,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:45,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:45,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:55:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:45,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:45,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:45,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 03:55:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:45,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:55:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:45,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 03:55:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:45,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 03:55:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:45,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 03:55:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:45,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:55:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:45,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:46,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 03:55:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:46,011 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-29 03:55:46,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:55:46,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201707629] [2023-11-29 03:55:46,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201707629] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:55:46,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211208971] [2023-11-29 03:55:46,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:46,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:46,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:55:46,013 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:55:46,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 03:55:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:46,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 03:55:46,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:55:46,652 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-29 03:55:46,652 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:55:46,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211208971] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:55:46,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:55:46,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2023-11-29 03:55:46,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170737021] [2023-11-29 03:55:46,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:55:46,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:55:46,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:55:46,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:55:46,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2023-11-29 03:55:46,655 INFO L87 Difference]: Start difference. First operand 123 states and 172 transitions. Second operand has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2023-11-29 03:55:47,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:55:47,098 INFO L93 Difference]: Finished difference Result 248 states and 357 transitions. [2023-11-29 03:55:47,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:55:47,099 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 107 [2023-11-29 03:55:47,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:55:47,100 INFO L225 Difference]: With dead ends: 248 [2023-11-29 03:55:47,100 INFO L226 Difference]: Without dead ends: 140 [2023-11-29 03:55:47,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2023-11-29 03:55:47,102 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 90 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:55:47,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 859 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:55:47,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-29 03:55:47,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2023-11-29 03:55:47,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 90 states have internal predecessors, (102), 36 states have call successors, (36), 8 states have call predecessors, (36), 12 states have return successors, (48), 33 states have call predecessors, (48), 34 states have call successors, (48) [2023-11-29 03:55:47,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 186 transitions. [2023-11-29 03:55:47,116 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 186 transitions. Word has length 107 [2023-11-29 03:55:47,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:55:47,116 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 186 transitions. [2023-11-29 03:55:47,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2023-11-29 03:55:47,117 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 186 transitions. [2023-11-29 03:55:47,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 03:55:47,118 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:55:47,119 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 03:55:47,126 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 03:55:47,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:47,319 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:55:47,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:55:47,320 INFO L85 PathProgramCache]: Analyzing trace with hash -425398743, now seen corresponding path program 1 times [2023-11-29 03:55:47,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:55:47,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480509800] [2023-11-29 03:55:47,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:47,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:55:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:47,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:47,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:47,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:47,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:55:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:47,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:47,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:47,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 03:55:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:47,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:55:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:47,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 03:55:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:47,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 03:55:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:47,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 03:55:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:47,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:55:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:47,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:47,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 03:55:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-11-29 03:55:47,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:55:47,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480509800] [2023-11-29 03:55:47,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480509800] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:55:47,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776130110] [2023-11-29 03:55:47,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:47,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:47,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:55:47,803 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:55:47,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 03:55:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:48,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 03:55:48,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:55:48,429 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-29 03:55:48,430 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:55:48,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776130110] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:55:48,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:55:48,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 12 [2023-11-29 03:55:48,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573431332] [2023-11-29 03:55:48,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:55:48,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:55:48,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:55:48,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:55:48,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:55:48,432 INFO L87 Difference]: Start difference. First operand 130 states and 186 transitions. Second operand has 9 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2023-11-29 03:55:48,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:55:48,726 INFO L93 Difference]: Finished difference Result 251 states and 368 transitions. [2023-11-29 03:55:48,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:55:48,727 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 107 [2023-11-29 03:55:48,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:55:48,728 INFO L225 Difference]: With dead ends: 251 [2023-11-29 03:55:48,728 INFO L226 Difference]: Without dead ends: 136 [2023-11-29 03:55:48,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2023-11-29 03:55:48,730 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 30 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:55:48,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 918 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:55:48,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-29 03:55:48,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 131. [2023-11-29 03:55:48,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 91 states have internal predecessors, (103), 36 states have call successors, (36), 8 states have call predecessors, (36), 12 states have return successors, (48), 33 states have call predecessors, (48), 34 states have call successors, (48) [2023-11-29 03:55:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 187 transitions. [2023-11-29 03:55:48,741 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 187 transitions. Word has length 107 [2023-11-29 03:55:48,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:55:48,741 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 187 transitions. [2023-11-29 03:55:48,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2023-11-29 03:55:48,742 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 187 transitions. [2023-11-29 03:55:48,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 03:55:48,743 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:55:48,743 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 03:55:48,750 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 03:55:48,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:48,944 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:55:48,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:55:48,944 INFO L85 PathProgramCache]: Analyzing trace with hash -48386404, now seen corresponding path program 1 times [2023-11-29 03:55:48,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:55:48,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672472350] [2023-11-29 03:55:48,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:48,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:55:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:49,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:49,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:49,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:49,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:55:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:49,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:49,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:49,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 03:55:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:49,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:55:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:49,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 03:55:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:49,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 03:55:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:49,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:55:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:49,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:55:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:49,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:49,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:55:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:49,552 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 03:55:49,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:55:49,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672472350] [2023-11-29 03:55:49,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672472350] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:55:49,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565642041] [2023-11-29 03:55:49,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:49,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:49,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:55:49,553 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:55:49,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 03:55:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:50,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-29 03:55:50,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:55:50,150 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-29 03:55:50,150 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:55:50,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565642041] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:55:50,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:55:50,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2023-11-29 03:55:50,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787083488] [2023-11-29 03:55:50,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:55:50,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:55:50,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:55:50,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:55:50,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:55:50,152 INFO L87 Difference]: Start difference. First operand 131 states and 187 transitions. Second operand has 10 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 6 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2023-11-29 03:55:50,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:55:50,520 INFO L93 Difference]: Finished difference Result 258 states and 380 transitions. [2023-11-29 03:55:50,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:55:50,521 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 6 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Word has length 109 [2023-11-29 03:55:50,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:55:50,522 INFO L225 Difference]: With dead ends: 258 [2023-11-29 03:55:50,522 INFO L226 Difference]: Without dead ends: 142 [2023-11-29 03:55:50,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2023-11-29 03:55:50,524 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 32 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:55:50,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 919 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:55:50,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-29 03:55:50,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 132. [2023-11-29 03:55:50,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 92 states have internal predecessors, (104), 36 states have call successors, (36), 8 states have call predecessors, (36), 12 states have return successors, (48), 33 states have call predecessors, (48), 34 states have call successors, (48) [2023-11-29 03:55:50,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 188 transitions. [2023-11-29 03:55:50,538 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 188 transitions. Word has length 109 [2023-11-29 03:55:50,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:55:50,538 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 188 transitions. [2023-11-29 03:55:50,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 6 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2023-11-29 03:55:50,539 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 188 transitions. [2023-11-29 03:55:50,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 03:55:50,540 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:55:50,540 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 03:55:50,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-29 03:55:50,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 03:55:50,743 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:55:50,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:55:50,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1965044450, now seen corresponding path program 1 times [2023-11-29 03:55:50,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:55:50,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514432095] [2023-11-29 03:55:50,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:50,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:55:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:51,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:51,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:51,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:51,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:55:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:51,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:51,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:51,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 03:55:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:51,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:55:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:51,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:55:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:51,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:55:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:51,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:55:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:51,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:55:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:51,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:51,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-29 03:55:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-11-29 03:55:51,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:55:51,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514432095] [2023-11-29 03:55:51,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514432095] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:55:51,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451438961] [2023-11-29 03:55:51,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:51,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:51,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:55:51,169 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:55:51,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 03:55:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:51,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 03:55:51,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:55:51,721 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-29 03:55:51,721 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:55:51,933 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-11-29 03:55:51,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451438961] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:55:51,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:55:51,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 16 [2023-11-29 03:55:51,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410732445] [2023-11-29 03:55:51,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:55:51,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 03:55:51,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:55:51,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 03:55:51,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2023-11-29 03:55:51,936 INFO L87 Difference]: Start difference. First operand 132 states and 188 transitions. Second operand has 16 states, 13 states have (on average 5.769230769230769) internal successors, (75), 11 states have internal predecessors, (75), 5 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (21), 6 states have call predecessors, (21), 5 states have call successors, (21) [2023-11-29 03:55:52,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:55:52,847 INFO L93 Difference]: Finished difference Result 254 states and 366 transitions. [2023-11-29 03:55:52,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:55:52,848 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 5.769230769230769) internal successors, (75), 11 states have internal predecessors, (75), 5 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (21), 6 states have call predecessors, (21), 5 states have call successors, (21) Word has length 110 [2023-11-29 03:55:52,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:55:52,850 INFO L225 Difference]: With dead ends: 254 [2023-11-29 03:55:52,850 INFO L226 Difference]: Without dead ends: 140 [2023-11-29 03:55:52,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2023-11-29 03:55:52,852 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 56 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:55:52,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 599 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 03:55:52,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-29 03:55:52,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2023-11-29 03:55:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 84 states have (on average 1.25) internal successors, (105), 94 states have internal predecessors, (105), 36 states have call successors, (36), 8 states have call predecessors, (36), 13 states have return successors, (53), 33 states have call predecessors, (53), 34 states have call successors, (53) [2023-11-29 03:55:52,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 194 transitions. [2023-11-29 03:55:52,868 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 194 transitions. Word has length 110 [2023-11-29 03:55:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:55:52,869 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 194 transitions. [2023-11-29 03:55:52,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 5.769230769230769) internal successors, (75), 11 states have internal predecessors, (75), 5 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (21), 6 states have call predecessors, (21), 5 states have call successors, (21) [2023-11-29 03:55:52,869 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 194 transitions. [2023-11-29 03:55:52,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 03:55:52,871 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:55:52,871 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 03:55:52,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-29 03:55:53,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:53,072 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:55:53,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:55:53,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1479170082, now seen corresponding path program 1 times [2023-11-29 03:55:53,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:55:53,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304796628] [2023-11-29 03:55:53,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:53,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:55:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:53,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:53,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:53,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:53,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:55:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:53,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:53,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:53,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 03:55:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:53,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:55:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:53,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:55:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:53,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:55:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:53,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 03:55:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:53,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 03:55:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:53,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:53,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 03:55:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:53,471 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 03:55:53,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:55:53,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304796628] [2023-11-29 03:55:53,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304796628] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:55:53,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302126875] [2023-11-29 03:55:53,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:53,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:53,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:55:53,473 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:55:53,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 03:55:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:53,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 03:55:53,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:55:54,039 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-29 03:55:54,039 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:55:54,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302126875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:55:54,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:55:54,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2023-11-29 03:55:54,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093042812] [2023-11-29 03:55:54,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:55:54,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:55:54,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:55:54,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:55:54,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:55:54,040 INFO L87 Difference]: Start difference. First operand 134 states and 194 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 4 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-11-29 03:55:54,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:55:54,251 INFO L93 Difference]: Finished difference Result 253 states and 368 transitions. [2023-11-29 03:55:54,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:55:54,251 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 4 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 112 [2023-11-29 03:55:54,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:55:54,253 INFO L225 Difference]: With dead ends: 253 [2023-11-29 03:55:54,253 INFO L226 Difference]: Without dead ends: 137 [2023-11-29 03:55:54,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:55:54,255 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 52 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:55:54,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 574 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:55:54,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-29 03:55:54,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2023-11-29 03:55:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 95 states have internal predecessors, (106), 36 states have call successors, (36), 8 states have call predecessors, (36), 13 states have return successors, (53), 33 states have call predecessors, (53), 34 states have call successors, (53) [2023-11-29 03:55:54,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 195 transitions. [2023-11-29 03:55:54,267 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 195 transitions. Word has length 112 [2023-11-29 03:55:54,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:55:54,267 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 195 transitions. [2023-11-29 03:55:54,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 4 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-11-29 03:55:54,268 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 195 transitions. [2023-11-29 03:55:54,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 03:55:54,269 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:55:54,269 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 03:55:54,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-11-29 03:55:54,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 03:55:54,469 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:55:54,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:55:54,470 INFO L85 PathProgramCache]: Analyzing trace with hash 2134740949, now seen corresponding path program 1 times [2023-11-29 03:55:54,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:55:54,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744928882] [2023-11-29 03:55:54,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:54,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:55:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:54,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:54,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:54,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:54,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:55:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:54,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:54,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:54,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 03:55:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:54,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:55:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:54,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:55:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:54,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:55:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:54,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 03:55:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:54,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:55:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:54,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:54,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:55:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 03:55:54,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:55:54,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744928882] [2023-11-29 03:55:54,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744928882] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:55:54,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057805662] [2023-11-29 03:55:54,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:54,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:54,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:55:54,806 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:55:54,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-29 03:55:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:55,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 03:55:55,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:55:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-29 03:55:55,448 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:55:55,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057805662] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:55:55,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:55:55,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2023-11-29 03:55:55,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316587287] [2023-11-29 03:55:55,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:55:55,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:55:55,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:55:55,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:55:55,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2023-11-29 03:55:55,450 INFO L87 Difference]: Start difference. First operand 135 states and 195 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-11-29 03:55:55,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:55:55,837 INFO L93 Difference]: Finished difference Result 263 states and 380 transitions. [2023-11-29 03:55:55,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:55:55,838 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 114 [2023-11-29 03:55:55,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:55:55,840 INFO L225 Difference]: With dead ends: 263 [2023-11-29 03:55:55,840 INFO L226 Difference]: Without dead ends: 146 [2023-11-29 03:55:55,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2023-11-29 03:55:55,842 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 71 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:55:55,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 665 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:55:55,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-29 03:55:55,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 136. [2023-11-29 03:55:55,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 86 states have (on average 1.244186046511628) internal successors, (107), 96 states have internal predecessors, (107), 36 states have call successors, (36), 8 states have call predecessors, (36), 13 states have return successors, (53), 33 states have call predecessors, (53), 34 states have call successors, (53) [2023-11-29 03:55:55,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 196 transitions. [2023-11-29 03:55:55,854 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 196 transitions. Word has length 114 [2023-11-29 03:55:55,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:55:55,854 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 196 transitions. [2023-11-29 03:55:55,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-11-29 03:55:55,855 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 196 transitions. [2023-11-29 03:55:55,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-29 03:55:55,856 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:55:55,856 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 03:55:55,864 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-29 03:55:56,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 03:55:56,057 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:55:56,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:55:56,057 INFO L85 PathProgramCache]: Analyzing trace with hash -891135047, now seen corresponding path program 1 times [2023-11-29 03:55:56,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:55:56,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333157812] [2023-11-29 03:55:56,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:56,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:55:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:56,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:56,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:56,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:56,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:55:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:56,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:56,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:56,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 03:55:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:56,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:55:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:56,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:55:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:56,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:55:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:56,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:55:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:56,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:55:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:56,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:55:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:56,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:56,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 03:55:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:56,430 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-11-29 03:55:56,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:55:56,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333157812] [2023-11-29 03:55:56,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333157812] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:55:56,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376572942] [2023-11-29 03:55:56,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:56,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:56,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:55:56,432 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:55:56,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-29 03:55:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:56,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 03:55:56,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:55:56,989 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-29 03:55:56,989 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:55:57,189 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-11-29 03:55:57,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376572942] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:55:57,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:55:57,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 8] total 18 [2023-11-29 03:55:57,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165547171] [2023-11-29 03:55:57,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:55:57,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 03:55:57,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:55:57,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 03:55:57,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2023-11-29 03:55:57,191 INFO L87 Difference]: Start difference. First operand 136 states and 196 transitions. Second operand has 18 states, 15 states have (on average 5.133333333333334) internal successors, (77), 13 states have internal predecessors, (77), 5 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (21), 6 states have call predecessors, (21), 5 states have call successors, (21) [2023-11-29 03:55:58,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:55:58,171 INFO L93 Difference]: Finished difference Result 271 states and 394 transitions. [2023-11-29 03:55:58,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 03:55:58,172 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 5.133333333333334) internal successors, (77), 13 states have internal predecessors, (77), 5 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (21), 6 states have call predecessors, (21), 5 states have call successors, (21) Word has length 122 [2023-11-29 03:55:58,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:55:58,173 INFO L225 Difference]: With dead ends: 271 [2023-11-29 03:55:58,174 INFO L226 Difference]: Without dead ends: 153 [2023-11-29 03:55:58,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2023-11-29 03:55:58,175 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 59 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:55:58,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 772 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1288 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 03:55:58,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-11-29 03:55:58,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 140. [2023-11-29 03:55:58,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 100 states have internal predecessors, (110), 36 states have call successors, (36), 8 states have call predecessors, (36), 14 states have return successors, (56), 33 states have call predecessors, (56), 34 states have call successors, (56) [2023-11-29 03:55:58,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 202 transitions. [2023-11-29 03:55:58,183 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 202 transitions. Word has length 122 [2023-11-29 03:55:58,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:55:58,184 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 202 transitions. [2023-11-29 03:55:58,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 5.133333333333334) internal successors, (77), 13 states have internal predecessors, (77), 5 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (21), 6 states have call predecessors, (21), 5 states have call successors, (21) [2023-11-29 03:55:58,184 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 202 transitions. [2023-11-29 03:55:58,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 03:55:58,185 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:55:58,185 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 03:55:58,192 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-11-29 03:55:58,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 03:55:58,385 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:55:58,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:55:58,386 INFO L85 PathProgramCache]: Analyzing trace with hash 604178860, now seen corresponding path program 2 times [2023-11-29 03:55:58,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:55:58,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087983135] [2023-11-29 03:55:58,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:58,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:55:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:58,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:58,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:58,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:58,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:55:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:58,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:58,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:55:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:58,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 03:55:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:58,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:55:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:58,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:55:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:58,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:55:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:58,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:55:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:58,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 03:55:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:58,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 03:55:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:58,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:55:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:58,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 03:55:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:58,883 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-11-29 03:55:58,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:55:58,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087983135] [2023-11-29 03:55:58,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087983135] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:55:58,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414111254] [2023-11-29 03:55:58,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:55:58,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:58,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:55:58,885 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:55:58,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-29 03:55:59,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:55:59,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:55:59,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 86 conjunts are in the unsatisfiable core [2023-11-29 03:55:59,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:55:59,630 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 18 treesize of output 19 [2023-11-29 03:55:59,636 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 16 treesize of output 17 [2023-11-29 03:55:59,834 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 0 case distinctions, treesize of input 16 treesize of output 21 [2023-11-29 03:55:59,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 19 [2023-11-29 03:55:59,918 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:55:59,919 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 23 treesize of output 20 [2023-11-29 03:55:59,945 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:55:59,945 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 23 treesize of output 20 [2023-11-29 03:55:59,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:56:02,331 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 03:56:02,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 19 [2023-11-29 03:56:02,341 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 03:56:02,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 13 [2023-11-29 03:56:02,379 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-11-29 03:56:02,379 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:56:02,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414111254] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:56:02,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:56:02,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [9] total 23 [2023-11-29 03:56:02,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131062308] [2023-11-29 03:56:02,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:56:02,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 03:56:02,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:56:02,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 03:56:02,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2023-11-29 03:56:02,381 INFO L87 Difference]: Start difference. First operand 140 states and 202 transitions. Second operand has 16 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 8 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2023-11-29 03:56:04,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:56:04,862 INFO L93 Difference]: Finished difference Result 362 states and 513 transitions. [2023-11-29 03:56:04,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 03:56:04,862 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 8 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Word has length 124 [2023-11-29 03:56:04,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:56:04,864 INFO L225 Difference]: With dead ends: 362 [2023-11-29 03:56:04,864 INFO L226 Difference]: Without dead ends: 235 [2023-11-29 03:56:04,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 133 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=117, Invalid=813, Unknown=0, NotChecked=0, Total=930 [2023-11-29 03:56:04,866 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 132 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:56:04,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 533 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 03:56:04,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-11-29 03:56:04,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 222. [2023-11-29 03:56:04,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 142 states have (on average 1.2112676056338028) internal successors, (172), 157 states have internal predecessors, (172), 57 states have call successors, (57), 15 states have call predecessors, (57), 22 states have return successors, (85), 51 states have call predecessors, (85), 55 states have call successors, (85) [2023-11-29 03:56:04,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 314 transitions. [2023-11-29 03:56:04,887 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 314 transitions. Word has length 124 [2023-11-29 03:56:04,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:56:04,887 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 314 transitions. [2023-11-29 03:56:04,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 8 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2023-11-29 03:56:04,888 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 314 transitions. [2023-11-29 03:56:04,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-29 03:56:04,890 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:56:04,890 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 03:56:04,898 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-11-29 03:56:05,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:56:05,090 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:56:05,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:56:05,091 INFO L85 PathProgramCache]: Analyzing trace with hash 2084720020, now seen corresponding path program 1 times [2023-11-29 03:56:05,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:56:05,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007541098] [2023-11-29 03:56:05,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:56:05,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:56:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:05,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:56:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:05,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:56:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:05,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:56:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:05,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 03:56:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:05,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:56:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:05,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:56:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:05,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-29 03:56:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:05,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:56:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:05,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 03:56:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:05,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 03:56:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:05,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:56:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:05,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 03:56:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:05,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:56:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:05,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:56:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:05,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:56:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:05,606 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-11-29 03:56:05,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:56:05,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007541098] [2023-11-29 03:56:05,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007541098] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:56:05,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248383165] [2023-11-29 03:56:05,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:56:05,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:56:05,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:56:05,611 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:56:05,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-29 03:56:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:06,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 03:56:06,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:56:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 72 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-29 03:56:06,279 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:56:06,582 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-11-29 03:56:06,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248383165] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:56:06,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:56:06,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2023-11-29 03:56:06,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697799139] [2023-11-29 03:56:06,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:56:06,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 03:56:06,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:56:06,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 03:56:06,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2023-11-29 03:56:06,585 INFO L87 Difference]: Start difference. First operand 222 states and 314 transitions. Second operand has 24 states, 24 states have (on average 5.041666666666667) internal successors, (121), 23 states have internal predecessors, (121), 11 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (29), 9 states have call predecessors, (29), 11 states have call successors, (29) [2023-11-29 03:56:07,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:56:07,851 INFO L93 Difference]: Finished difference Result 401 states and 598 transitions. [2023-11-29 03:56:07,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 03:56:07,851 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.041666666666667) internal successors, (121), 23 states have internal predecessors, (121), 11 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (29), 9 states have call predecessors, (29), 11 states have call successors, (29) Word has length 125 [2023-11-29 03:56:07,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:56:07,854 INFO L225 Difference]: With dead ends: 401 [2023-11-29 03:56:07,854 INFO L226 Difference]: Without dead ends: 200 [2023-11-29 03:56:07,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 268 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=905, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 03:56:07,856 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 205 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:56:07,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 693 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 03:56:07,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-11-29 03:56:07,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 195. [2023-11-29 03:56:07,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 123 states have (on average 1.170731707317073) internal successors, (144), 132 states have internal predecessors, (144), 53 states have call successors, (53), 15 states have call predecessors, (53), 18 states have return successors, (68), 49 states have call predecessors, (68), 51 states have call successors, (68) [2023-11-29 03:56:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 265 transitions. [2023-11-29 03:56:07,878 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 265 transitions. Word has length 125 [2023-11-29 03:56:07,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:56:07,878 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 265 transitions. [2023-11-29 03:56:07,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.041666666666667) internal successors, (121), 23 states have internal predecessors, (121), 11 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (29), 9 states have call predecessors, (29), 11 states have call successors, (29) [2023-11-29 03:56:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 265 transitions. [2023-11-29 03:56:07,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-29 03:56:07,880 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:56:07,880 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 03:56:07,887 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-11-29 03:56:08,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:56:08,081 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:56:08,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:56:08,081 INFO L85 PathProgramCache]: Analyzing trace with hash -409005928, now seen corresponding path program 1 times [2023-11-29 03:56:08,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:56:08,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279819253] [2023-11-29 03:56:08,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:56:08,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:56:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:08,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:56:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:08,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:56:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:08,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:56:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:08,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 03:56:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:08,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:56:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:08,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:56:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:08,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-29 03:56:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:08,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:56:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:08,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 03:56:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:08,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 03:56:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:08,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:56:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:08,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 03:56:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:08,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 03:56:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:08,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:56:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:08,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:56:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:08,749 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-29 03:56:08,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:56:08,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279819253] [2023-11-29 03:56:08,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279819253] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:56:08,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542871833] [2023-11-29 03:56:08,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:56:08,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:56:08,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:56:08,751 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:56:08,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-29 03:56:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:09,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 03:56:09,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:56:09,515 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 58 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-29 03:56:09,515 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:56:09,781 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-11-29 03:56:09,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542871833] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:56:09,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:56:09,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 9] total 25 [2023-11-29 03:56:09,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555881069] [2023-11-29 03:56:09,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:56:09,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 03:56:09,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:56:09,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 03:56:09,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2023-11-29 03:56:09,784 INFO L87 Difference]: Start difference. First operand 195 states and 265 transitions. Second operand has 25 states, 22 states have (on average 4.590909090909091) internal successors, (101), 20 states have internal predecessors, (101), 8 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (25), 9 states have call predecessors, (25), 8 states have call successors, (25) [2023-11-29 03:56:11,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:56:11,805 INFO L93 Difference]: Finished difference Result 347 states and 494 transitions. [2023-11-29 03:56:11,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 03:56:11,806 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 4.590909090909091) internal successors, (101), 20 states have internal predecessors, (101), 8 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (25), 9 states have call predecessors, (25), 8 states have call successors, (25) Word has length 125 [2023-11-29 03:56:11,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:56:11,808 INFO L225 Difference]: With dead ends: 347 [2023-11-29 03:56:11,808 INFO L226 Difference]: Without dead ends: 209 [2023-11-29 03:56:11,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=274, Invalid=1618, Unknown=0, NotChecked=0, Total=1892 [2023-11-29 03:56:11,810 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 170 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 1991 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 2044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:56:11,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1151 Invalid, 2044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1991 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 03:56:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-11-29 03:56:11,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 191. [2023-11-29 03:56:11,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 120 states have (on average 1.175) internal successors, (141), 127 states have internal predecessors, (141), 54 states have call successors, (54), 15 states have call predecessors, (54), 16 states have return successors, (61), 50 states have call predecessors, (61), 52 states have call successors, (61) [2023-11-29 03:56:11,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 256 transitions. [2023-11-29 03:56:11,830 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 256 transitions. Word has length 125 [2023-11-29 03:56:11,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:56:11,830 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 256 transitions. [2023-11-29 03:56:11,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 4.590909090909091) internal successors, (101), 20 states have internal predecessors, (101), 8 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (25), 9 states have call predecessors, (25), 8 states have call successors, (25) [2023-11-29 03:56:11,830 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 256 transitions. [2023-11-29 03:56:11,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-29 03:56:11,831 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:56:11,831 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 03:56:11,838 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-11-29 03:56:12,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-29 03:56:12,032 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:56:12,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:56:12,032 INFO L85 PathProgramCache]: Analyzing trace with hash -506744072, now seen corresponding path program 1 times [2023-11-29 03:56:12,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:56:12,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289956281] [2023-11-29 03:56:12,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:56:12,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:56:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:12,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:56:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:12,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:56:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:12,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:56:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:12,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 03:56:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:12,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:56:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:12,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:56:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:12,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-29 03:56:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:13,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:56:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:13,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 03:56:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:13,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 03:56:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:13,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:56:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:13,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:56:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:13,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 03:56:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:13,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:56:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:13,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 03:56:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:13,178 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-11-29 03:56:13,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:56:13,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289956281] [2023-11-29 03:56:13,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289956281] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:56:13,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133322726] [2023-11-29 03:56:13,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:56:13,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:56:13,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:56:13,180 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:56:13,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-29 03:56:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:56:13,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-29 03:56:13,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:56:13,862 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 03:56:13,876 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:56:13,876 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 03:56:13,883 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 03:56:13,964 INFO L349 Elim1Store]: treesize reduction 74, result has 32.1 percent of original size [2023-11-29 03:56:13,964 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 2 case distinctions, treesize of input 83 treesize of output 54 [2023-11-29 03:56:14,226 INFO L349 Elim1Store]: treesize reduction 32, result has 37.3 percent of original size [2023-11-29 03:56:14,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 43 [2023-11-29 03:56:14,233 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 03:56:14,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2023-11-29 03:56:18,453 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_10| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_10|))) (let ((.cse1 (select .cse0 24))) (and (= (select .cse0 0) .cse1) (<= (+ 2 .cse1) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_10|))))) (exists ((ensure_linked_list_is_allocated_~curr~0.offset Int) (v_arrayElimCell_19 Int)) (<= (+ 2 v_arrayElimCell_19) (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_19) ensure_linked_list_is_allocated_~curr~0.offset)))) is different from true [2023-11-29 03:56:34,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:56:34,479 INFO L349 Elim1Store]: treesize reduction 26, result has 86.5 percent of original size [2023-11-29 03:56:34,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 77 treesize of output 202 [2023-11-29 03:56:35,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:56:35,243 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 74 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 7 not checked. [2023-11-29 03:56:35,243 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:56:35,494 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 03:56:35,494 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 28 treesize of output 27 [2023-11-29 03:56:40,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:56:40,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2023-11-29 03:56:49,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133322726] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:56:49,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:56:49,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 31] total 40 [2023-11-29 03:56:49,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326292472] [2023-11-29 03:56:49,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:56:49,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-29 03:56:49,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:56:49,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-29 03:56:49,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2346, Unknown=7, NotChecked=98, Total=2652 [2023-11-29 03:56:49,439 INFO L87 Difference]: Start difference. First operand 191 states and 256 transitions. Second operand has 40 states, 34 states have (on average 4.176470588235294) internal successors, (142), 35 states have internal predecessors, (142), 18 states have call successors, (29), 7 states have call predecessors, (29), 10 states have return successors, (28), 16 states have call predecessors, (28), 18 states have call successors, (28) [2023-11-29 03:56:53,475 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 03:56:58,310 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 03:57:06,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:57:10,440 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 03:57:14,542 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 03:57:18,624 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 03:57:22,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:57:26,746 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 03:57:30,835 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 03:57:34,928 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 03:57:39,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:57:43,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:57:50,351 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 03:57:58,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:58:03,115 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 03:58:07,196 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 03:58:11,302 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 03:58:12,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:58:16,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:58:20,833 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 03:58:24,913 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 03:58:29,019 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 03:58:33,064 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 03:58:45,599 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 03:58:49,607 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 03:58:53,673 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 03:59:05,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:59:09,843 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 03:59:13,881 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 03:59:17,983 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 03:59:22,015 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 03:59:26,296 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 03:59:30,967 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 03:59:35,390 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 03:59:40,058 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 03:59:44,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:59:56,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:00:00,295 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 04:00:04,390 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 04:00:08,428 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 04:00:21,015 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 04:00:25,386 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 04:00:29,625 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 04:00:33,828 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 04:00:37,897 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 04:00:46,107 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 04:00:50,518 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 04:00:54,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:00:58,713 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 04:01:02,806 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 04:01:06,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:01:10,967 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 04:01:14,971 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 04:01:19,018 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 04:01:23,048 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 04:01:27,054 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 04:01:31,298 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 04:01:35,327 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 04:01:39,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:01:43,570 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 04:03:06,074 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 04:03:09,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:03:12,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:03:14,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:03:21,032 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 04:03:25,068 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 04:03:29,340 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 04:03:33,433 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 04:03:37,441 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 04:03:41,444 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 04:03:45,449 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 04:03:49,453 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 04:03:53,457 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 04:03:57,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:04:01,469 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 04:04:05,473 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 04:04:09,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:04:13,527 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 04:04:17,579 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 04:04:21,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:04:25,611 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 04:04:29,713 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 04:04:35,568 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 04:04:39,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:04:43,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:04:47,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:04:52,747 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 04:04:56,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:05:00,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:05:02,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:05:09,564 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 04:05:14,002 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 04:05:18,041 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 04:05:22,677 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 04:05:27,714 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 04:05:35,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:05:35,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:05:35,155 INFO L93 Difference]: Finished difference Result 484 states and 672 transitions. [2023-11-29 04:05:35,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 04:05:35,156 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 34 states have (on average 4.176470588235294) internal successors, (142), 35 states have internal predecessors, (142), 18 states have call successors, (29), 7 states have call predecessors, (29), 10 states have return successors, (28), 16 states have call predecessors, (28), 18 states have call successors, (28) Word has length 126 [2023-11-29 04:05:35,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:05:35,159 INFO L225 Difference]: With dead ends: 484 [2023-11-29 04:05:35,159 INFO L226 Difference]: Without dead ends: 356 [2023-11-29 04:05:35,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 193 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1660 ImplicationChecksByTransitivity, 155.6s TimeCoverageRelationStatistics Valid=688, Invalid=6086, Unknown=36, NotChecked=162, Total=6972 [2023-11-29 04:05:35,163 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 329 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 4212 mSolverCounterSat, 212 mSolverCounterUnsat, 90 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 402.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 4836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 4212 IncrementalHoareTripleChecker+Invalid, 90 IncrementalHoareTripleChecker+Unknown, 322 IncrementalHoareTripleChecker+Unchecked, 402.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:05:35,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 923 Invalid, 4836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 4212 Invalid, 90 Unknown, 322 Unchecked, 402.7s Time] [2023-11-29 04:05:35,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2023-11-29 04:05:35,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 311. [2023-11-29 04:05:35,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 205 states have (on average 1.1512195121951219) internal successors, (236), 217 states have internal predecessors, (236), 78 states have call successors, (78), 24 states have call predecessors, (78), 27 states have return successors, (105), 72 states have call predecessors, (105), 76 states have call successors, (105) [2023-11-29 04:05:35,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 419 transitions. [2023-11-29 04:05:35,256 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 419 transitions. Word has length 126 [2023-11-29 04:05:35,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:05:35,257 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 419 transitions. [2023-11-29 04:05:35,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 34 states have (on average 4.176470588235294) internal successors, (142), 35 states have internal predecessors, (142), 18 states have call successors, (29), 7 states have call predecessors, (29), 10 states have return successors, (28), 16 states have call predecessors, (28), 18 states have call successors, (28) [2023-11-29 04:05:35,257 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 419 transitions. [2023-11-29 04:05:35,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-29 04:05:35,259 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:05:35,259 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 04:05:35,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-11-29 04:05:35,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-29 04:05:35,460 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:05:35,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:05:35,460 INFO L85 PathProgramCache]: Analyzing trace with hash -2140972145, now seen corresponding path program 2 times [2023-11-29 04:05:35,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:05:35,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316062645] [2023-11-29 04:05:35,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:05:35,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:05:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:05:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:05:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:05:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 04:05:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:05:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:05:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-29 04:05:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:05:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 04:05:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 04:05:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 04:05:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:05:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 04:05:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 04:05:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:05:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:37,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 04:05:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:38,003 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 37 proven. 12 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2023-11-29 04:05:38,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:05:38,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316062645] [2023-11-29 04:05:38,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316062645] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:05:38,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137306689] [2023-11-29 04:05:38,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:05:38,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:05:38,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:05:38,005 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:05:38,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-29 04:05:38,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:05:38,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:05:38,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 04:05:38,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:05:38,913 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 18 treesize of output 19 [2023-11-29 04:05:38,919 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 16 treesize of output 17 [2023-11-29 04:05:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 54 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-11-29 04:05:40,953 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:05:41,704 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-29 04:05:41,704 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 174 treesize of output 160 [2023-11-29 04:05:41,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:05:41,736 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 65 treesize of output 81 [2023-11-29 04:05:41,743 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 23 treesize of output 21 [2023-11-29 04:05:41,777 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 04:05:41,794 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 04:05:41,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:05:41,818 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 21 treesize of output 25 [2023-11-29 04:05:41,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:05:41,834 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 69 treesize of output 71 [2023-11-29 04:05:41,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:05:41,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:05:41,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:05:41,871 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 24 treesize of output 25 [2023-11-29 04:05:41,874 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-11-29 04:05:41,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:05:41,883 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 34 treesize of output 38 [2023-11-29 04:05:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 04:05:41,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137306689] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:05:41,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:05:41,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 13] total 44 [2023-11-29 04:05:41,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370020893] [2023-11-29 04:05:41,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:05:41,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-29 04:05:41,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:05:41,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-29 04:05:41,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1759, Unknown=0, NotChecked=0, Total=1892 [2023-11-29 04:05:41,995 INFO L87 Difference]: Start difference. First operand 311 states and 419 transitions. Second operand has 44 states, 34 states have (on average 3.9705882352941178) internal successors, (135), 35 states have internal predecessors, (135), 17 states have call successors, (36), 4 states have call predecessors, (36), 13 states have return successors, (35), 23 states have call predecessors, (35), 17 states have call successors, (35) [2023-11-29 04:05:46,527 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 [1] [2023-11-29 04:05:50,530 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 [1] [2023-11-29 04:05:54,533 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, 1] [2023-11-29 04:05:58,535 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, 1] [2023-11-29 04:06:02,539 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 [1] [2023-11-29 04:06:06,543 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 [1] [2023-11-29 04:06:10,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:06:17,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:06:17,537 INFO L93 Difference]: Finished difference Result 462 states and 617 transitions. [2023-11-29 04:06:17,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-29 04:06:17,538 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 34 states have (on average 3.9705882352941178) internal successors, (135), 35 states have internal predecessors, (135), 17 states have call successors, (36), 4 states have call predecessors, (36), 13 states have return successors, (35), 23 states have call predecessors, (35), 17 states have call successors, (35) Word has length 136 [2023-11-29 04:06:17,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:06:17,541 INFO L225 Difference]: With dead ends: 462 [2023-11-29 04:06:17,541 INFO L226 Difference]: Without dead ends: 341 [2023-11-29 04:06:17,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 271 SyntacticMatches, 7 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1622 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=553, Invalid=6089, Unknown=0, NotChecked=0, Total=6642 [2023-11-29 04:06:17,544 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 277 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 3918 mSolverCounterSat, 130 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 4055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 3918 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:06:17,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 1225 Invalid, 4055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 3918 Invalid, 7 Unknown, 0 Unchecked, 33.0s Time] [2023-11-29 04:06:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2023-11-29 04:06:17,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 318. [2023-11-29 04:06:17,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 217 states have (on average 1.1336405529953917) internal successors, (246), 228 states have internal predecessors, (246), 73 states have call successors, (73), 23 states have call predecessors, (73), 27 states have return successors, (99), 69 states have call predecessors, (99), 71 states have call successors, (99) [2023-11-29 04:06:17,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 418 transitions. [2023-11-29 04:06:17,615 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 418 transitions. Word has length 136 [2023-11-29 04:06:17,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:06:17,615 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 418 transitions. [2023-11-29 04:06:17,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 34 states have (on average 3.9705882352941178) internal successors, (135), 35 states have internal predecessors, (135), 17 states have call successors, (36), 4 states have call predecessors, (36), 13 states have return successors, (35), 23 states have call predecessors, (35), 17 states have call successors, (35) [2023-11-29 04:06:17,616 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 418 transitions. [2023-11-29 04:06:17,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-29 04:06:17,618 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:06:17,619 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 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, 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 04:06:17,628 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-11-29 04:06:17,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-29 04:06:17,819 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:06:17,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:06:17,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1063468436, now seen corresponding path program 1 times [2023-11-29 04:06:17,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:06:17,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21775422] [2023-11-29 04:06:17,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:06:17,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:06:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:18,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:06:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:18,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:06:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:18,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:06:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:18,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 04:06:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:18,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:06:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:18,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:06:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:18,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 04:06:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:18,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:06:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:18,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:06:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:18,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 04:06:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:18,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:06:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:18,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 04:06:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:18,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 04:06:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:18,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:06:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:18,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 04:06:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:18,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 04:06:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-11-29 04:06:18,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:06:18,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21775422] [2023-11-29 04:06:18,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21775422] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:06:18,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:06:18,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:06:18,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988571570] [2023-11-29 04:06:18,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:06:18,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:06:18,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:06:18,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:06:18,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:06:18,308 INFO L87 Difference]: Start difference. First operand 318 states and 418 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 7 states have internal predecessors, (53), 5 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-11-29 04:06:18,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:06:18,973 INFO L93 Difference]: Finished difference Result 433 states and 584 transitions. [2023-11-29 04:06:18,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:06:18,973 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 7 states have internal predecessors, (53), 5 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 132 [2023-11-29 04:06:18,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:06:18,976 INFO L225 Difference]: With dead ends: 433 [2023-11-29 04:06:18,976 INFO L226 Difference]: Without dead ends: 328 [2023-11-29 04:06:18,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-11-29 04:06:18,978 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 80 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:06:18,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 303 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 04:06:18,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2023-11-29 04:06:19,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2023-11-29 04:06:19,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 221 states have (on average 1.1312217194570136) internal successors, (250), 232 states have internal predecessors, (250), 78 states have call successors, (78), 24 states have call predecessors, (78), 28 states have return successors, (106), 74 states have call predecessors, (106), 76 states have call successors, (106) [2023-11-29 04:06:19,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 434 transitions. [2023-11-29 04:06:19,044 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 434 transitions. Word has length 132 [2023-11-29 04:06:19,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:06:19,044 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 434 transitions. [2023-11-29 04:06:19,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 7 states have internal predecessors, (53), 5 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-11-29 04:06:19,044 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 434 transitions. [2023-11-29 04:06:19,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-29 04:06:19,047 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:06:19,047 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 04:06:19,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 04:06:19,047 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:06:19,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:06:19,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1698397832, now seen corresponding path program 1 times [2023-11-29 04:06:19,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:06:19,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469457581] [2023-11-29 04:06:19,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:06:19,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:06:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:20,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:06:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:20,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:06:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:20,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:06:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:20,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 04:06:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:20,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:06:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:20,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:06:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:20,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-29 04:06:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:20,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:06:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:21,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:06:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:21,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:06:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:21,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:06:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:21,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 04:06:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:21,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 04:06:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:21,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:06:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:21,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 04:06:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:21,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 04:06:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:21,065 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-29 04:06:21,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:06:21,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469457581] [2023-11-29 04:06:21,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469457581] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:06:21,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553784400] [2023-11-29 04:06:21,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:06:21,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:06:21,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:06:21,067 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:06:21,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-29 04:06:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:21,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 04:06:21,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:06:21,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2023-11-29 04:06:21,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-11-29 04:06:22,257 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-11-29 04:06:22,257 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:06:22,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553784400] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:06:22,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:06:22,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [19] total 28 [2023-11-29 04:06:22,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841107423] [2023-11-29 04:06:22,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:06:22,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:06:22,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:06:22,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:06:22,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=689, Unknown=0, NotChecked=0, Total=756 [2023-11-29 04:06:22,260 INFO L87 Difference]: Start difference. First operand 328 states and 434 transitions. Second operand has 11 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 6 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2023-11-29 04:06:23,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:06:23,199 INFO L93 Difference]: Finished difference Result 513 states and 674 transitions. [2023-11-29 04:06:23,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:06:23,200 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 6 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 133 [2023-11-29 04:06:23,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:06:23,202 INFO L225 Difference]: With dead ends: 513 [2023-11-29 04:06:23,202 INFO L226 Difference]: Without dead ends: 391 [2023-11-29 04:06:23,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=100, Invalid=1022, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 04:06:23,204 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 92 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:06:23,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 905 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 04:06:23,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-11-29 04:06:23,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 379. [2023-11-29 04:06:23,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 262 states have (on average 1.1488549618320612) internal successors, (301), 272 states have internal predecessors, (301), 83 states have call successors, (83), 30 states have call predecessors, (83), 33 states have return successors, (109), 77 states have call predecessors, (109), 81 states have call successors, (109) [2023-11-29 04:06:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 493 transitions. [2023-11-29 04:06:23,261 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 493 transitions. Word has length 133 [2023-11-29 04:06:23,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:06:23,261 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 493 transitions. [2023-11-29 04:06:23,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 6 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2023-11-29 04:06:23,261 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 493 transitions. [2023-11-29 04:06:23,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-29 04:06:23,263 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:06:23,264 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 04:06:23,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2023-11-29 04:06:23,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-29 04:06:23,464 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:06:23,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:06:23,465 INFO L85 PathProgramCache]: Analyzing trace with hash 295432839, now seen corresponding path program 1 times [2023-11-29 04:06:23,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:06:23,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837015783] [2023-11-29 04:06:23,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:06:23,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:06:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:24,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:06:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:24,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:06:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:24,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:06:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:24,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 04:06:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:24,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:06:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:24,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:06:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:24,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 04:06:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:24,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:06:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:24,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 04:06:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:24,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 04:06:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:24,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 04:06:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:24,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:06:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:24,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 04:06:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:24,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 04:06:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:24,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:06:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:24,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-29 04:06:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:24,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 04:06:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:24,830 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 39 proven. 13 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-11-29 04:06:24,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:06:24,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837015783] [2023-11-29 04:06:24,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837015783] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:06:24,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716989892] [2023-11-29 04:06:24,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:06:24,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:06:24,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:06:24,831 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:06:24,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-11-29 04:06:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:25,439 INFO L262 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 04:06:25,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:06:25,504 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 04:06:25,519 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 04:06:25,520 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 04:06:25,524 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 04:06:25,610 INFO L349 Elim1Store]: treesize reduction 74, result has 32.1 percent of original size [2023-11-29 04:06:25,611 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 2 case distinctions, treesize of input 83 treesize of output 54 [2023-11-29 04:06:27,028 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 111 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-29 04:06:27,028 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:06:27,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:06:27,523 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 22 treesize of output 23 [2023-11-29 04:06:27,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-11-29 04:06:27,529 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 15 treesize of output 13 [2023-11-29 04:06:27,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:06:27,729 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 04:06:27,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:06:27,748 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 208 treesize of output 202 [2023-11-29 04:06:27,758 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 412 treesize of output 400 [2023-11-29 04:06:27,886 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 04:06:27,889 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 04:06:27,909 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 04:06:27,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:06:27,937 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 61 treesize of output 61 [2023-11-29 04:06:28,153 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 39 proven. 13 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-11-29 04:06:28,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716989892] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:06:28,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:06:28,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 39 [2023-11-29 04:06:28,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138552675] [2023-11-29 04:06:28,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:06:28,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 04:06:28,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:06:28,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 04:06:28,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1369, Unknown=0, NotChecked=0, Total=1482 [2023-11-29 04:06:28,156 INFO L87 Difference]: Start difference. First operand 379 states and 493 transitions. Second operand has 39 states, 34 states have (on average 4.911764705882353) internal successors, (167), 35 states have internal predecessors, (167), 13 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (35), 16 states have call predecessors, (35), 13 states have call successors, (35) [2023-11-29 04:06:34,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:06:34,579 INFO L93 Difference]: Finished difference Result 662 states and 873 transitions. [2023-11-29 04:06:34,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 04:06:34,580 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 34 states have (on average 4.911764705882353) internal successors, (167), 35 states have internal predecessors, (167), 13 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (35), 16 states have call predecessors, (35), 13 states have call successors, (35) Word has length 144 [2023-11-29 04:06:34,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:06:34,583 INFO L225 Difference]: With dead ends: 662 [2023-11-29 04:06:34,583 INFO L226 Difference]: Without dead ends: 466 [2023-11-29 04:06:34,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 301 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=370, Invalid=3412, Unknown=0, NotChecked=0, Total=3782 [2023-11-29 04:06:34,585 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 328 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 4281 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 4433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 4281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:06:34,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1085 Invalid, 4433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 4281 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-11-29 04:06:34,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2023-11-29 04:06:34,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 441. [2023-11-29 04:06:34,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 304 states have (on average 1.144736842105263) internal successors, (348), 315 states have internal predecessors, (348), 98 states have call successors, (98), 35 states have call predecessors, (98), 38 states have return successors, (123), 91 states have call predecessors, (123), 96 states have call successors, (123) [2023-11-29 04:06:34,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 569 transitions. [2023-11-29 04:06:34,654 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 569 transitions. Word has length 144 [2023-11-29 04:06:34,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:06:34,654 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 569 transitions. [2023-11-29 04:06:34,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 34 states have (on average 4.911764705882353) internal successors, (167), 35 states have internal predecessors, (167), 13 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (35), 16 states have call predecessors, (35), 13 states have call successors, (35) [2023-11-29 04:06:34,655 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 569 transitions. [2023-11-29 04:06:34,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 04:06:34,656 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:06:34,656 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 04:06:34,665 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-11-29 04:06:34,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-29 04:06:34,857 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:06:34,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:06:34,857 INFO L85 PathProgramCache]: Analyzing trace with hash -911947171, now seen corresponding path program 2 times [2023-11-29 04:06:34,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:06:34,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33118522] [2023-11-29 04:06:34,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:06:34,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:06:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:36,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:06:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:36,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:06:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:36,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:06:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:36,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 04:06:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:36,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:06:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:36,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:06:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:37,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:06:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:37,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:06:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:37,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:06:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:37,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:06:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:37,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:06:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:37,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 04:06:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:37,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 04:06:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:37,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 04:06:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:37,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:06:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:37,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 04:06:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:37,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-29 04:06:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:37,473 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 47 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-29 04:06:37,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:06:37,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33118522] [2023-11-29 04:06:37,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33118522] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:06:37,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862332736] [2023-11-29 04:06:37,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:06:37,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:06:37,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:06:37,475 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:06:37,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-11-29 04:06:37,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 04:06:37,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:06:37,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 04:06:37,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:06:37,973 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 40 treesize of output 19 [2023-11-29 04:06:37,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2023-11-29 04:06:38,795 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2023-11-29 04:06:38,796 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:06:38,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862332736] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:06:38,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:06:38,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2023-11-29 04:06:38,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104035342] [2023-11-29 04:06:38,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:06:38,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:06:38,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:06:38,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:06:38,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2023-11-29 04:06:38,798 INFO L87 Difference]: Start difference. First operand 441 states and 569 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 04:06:44,176 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 04:06:45,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:06:45,320 INFO L93 Difference]: Finished difference Result 663 states and 874 transitions. [2023-11-29 04:06:45,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:06:45,321 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 145 [2023-11-29 04:06:45,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:06:45,323 INFO L225 Difference]: With dead ends: 663 [2023-11-29 04:06:45,323 INFO L226 Difference]: Without dead ends: 528 [2023-11-29 04:06:45,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2023-11-29 04:06:45,325 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 129 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:06:45,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 522 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 532 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2023-11-29 04:06:45,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2023-11-29 04:06:45,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 516. [2023-11-29 04:06:45,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 354 states have (on average 1.155367231638418) internal successors, (409), 367 states have internal predecessors, (409), 117 states have call successors, (117), 40 states have call predecessors, (117), 44 states have return successors, (142), 108 states have call predecessors, (142), 113 states have call successors, (142) [2023-11-29 04:06:45,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 668 transitions. [2023-11-29 04:06:45,403 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 668 transitions. Word has length 145 [2023-11-29 04:06:45,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:06:45,404 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 668 transitions. [2023-11-29 04:06:45,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 04:06:45,404 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 668 transitions. [2023-11-29 04:06:45,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-29 04:06:45,406 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:06:45,406 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 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, 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] [2023-11-29 04:06:45,414 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-11-29 04:06:45,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-29 04:06:45,607 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:06:45,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:06:45,607 INFO L85 PathProgramCache]: Analyzing trace with hash 496024196, now seen corresponding path program 1 times [2023-11-29 04:06:45,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:06:45,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305642075] [2023-11-29 04:06:45,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:06:45,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:06:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:46,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:06:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:46,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:06:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:46,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:06:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:46,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 04:06:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:46,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:06:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:46,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:06:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:46,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-29 04:06:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:47,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:06:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:47,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:06:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:47,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:06:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:47,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:06:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:47,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 04:06:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:47,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 04:06:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:47,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:06:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:47,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 04:06:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:47,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 04:06:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-29 04:06:47,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:06:47,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305642075] [2023-11-29 04:06:47,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305642075] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:06:47,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115727555] [2023-11-29 04:06:47,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:06:47,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:06:47,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:06:47,046 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:06:47,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-11-29 04:06:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:47,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 83 conjunts are in the unsatisfiable core [2023-11-29 04:06:47,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:06:47,656 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 10 treesize of output 8 [2023-11-29 04:06:47,772 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 04:06:47,786 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 04:06:47,786 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 04:06:47,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 5 treesize of output 3 [2023-11-29 04:06:47,887 INFO L349 Elim1Store]: treesize reduction 60, result has 46.9 percent of original size [2023-11-29 04:06:47,887 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 2 case distinctions, treesize of input 63 treesize of output 60 [2023-11-29 04:06:48,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:06:48,239 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 04:06:48,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2023-11-29 04:06:48,250 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 9 treesize of output 3 [2023-11-29 04:06:48,824 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-29 04:06:48,824 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:06:49,310 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9457 (Array Int Int))) (not (= (+ |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#a~0#1.offset| 16) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#b~0#1.base| v_ArrVal_9457) |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#a~0#1.base|) |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#a~0#1.offset|)))) is different from false [2023-11-29 04:06:49,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115727555] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:06:49,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:06:49,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2023-11-29 04:06:49,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166648800] [2023-11-29 04:06:49,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:06:49,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-29 04:06:49,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:06:49,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-29 04:06:49,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1760, Unknown=1, NotChecked=84, Total=1980 [2023-11-29 04:06:49,313 INFO L87 Difference]: Start difference. First operand 516 states and 668 transitions. Second operand has 37 states, 27 states have (on average 5.037037037037037) internal successors, (136), 31 states have internal predecessors, (136), 14 states have call successors, (34), 5 states have call predecessors, (34), 9 states have return successors, (32), 12 states have call predecessors, (32), 14 states have call successors, (32) [2023-11-29 04:06:54,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:06:54,776 INFO L93 Difference]: Finished difference Result 822 states and 1051 transitions. [2023-11-29 04:06:54,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 04:06:54,776 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 27 states have (on average 5.037037037037037) internal successors, (136), 31 states have internal predecessors, (136), 14 states have call successors, (34), 5 states have call predecessors, (34), 9 states have return successors, (32), 12 states have call predecessors, (32), 14 states have call successors, (32) Word has length 133 [2023-11-29 04:06:54,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:06:54,779 INFO L225 Difference]: With dead ends: 822 [2023-11-29 04:06:54,779 INFO L226 Difference]: Without dead ends: 570 [2023-11-29 04:06:54,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=478, Invalid=4495, Unknown=1, NotChecked=138, Total=5112 [2023-11-29 04:06:54,781 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 401 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 2975 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 3232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 2975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:06:54,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 849 Invalid, 3232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 2975 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-11-29 04:06:54,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2023-11-29 04:06:54,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 522. [2023-11-29 04:06:54,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 357 states have (on average 1.1540616246498598) internal successors, (412), 369 states have internal predecessors, (412), 119 states have call successors, (119), 43 states have call predecessors, (119), 45 states have return successors, (142), 109 states have call predecessors, (142), 115 states have call successors, (142) [2023-11-29 04:06:54,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 673 transitions. [2023-11-29 04:06:54,907 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 673 transitions. Word has length 133 [2023-11-29 04:06:54,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:06:54,908 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 673 transitions. [2023-11-29 04:06:54,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 27 states have (on average 5.037037037037037) internal successors, (136), 31 states have internal predecessors, (136), 14 states have call successors, (34), 5 states have call predecessors, (34), 9 states have return successors, (32), 12 states have call predecessors, (32), 14 states have call successors, (32) [2023-11-29 04:06:54,908 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 673 transitions. [2023-11-29 04:06:54,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-29 04:06:54,910 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:06:54,910 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 04:06:54,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-11-29 04:06:55,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-29 04:06:55,111 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:06:55,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:06:55,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1787206751, now seen corresponding path program 2 times [2023-11-29 04:06:55,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:06:55,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686594603] [2023-11-29 04:06:55,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:06:55,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:06:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:56,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:06:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:57,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:06:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:57,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:06:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:57,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:06:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:58,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:06:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:58,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:06:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:58,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 04:06:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:58,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:06:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:58,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 04:06:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:58,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 04:06:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:58,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 04:06:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:58,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:06:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:58,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 04:06:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:58,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 04:06:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:58,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:06:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:58,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-29 04:06:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:58,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 04:06:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:06:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 3 proven. 62 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2023-11-29 04:06:58,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:06:58,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686594603] [2023-11-29 04:06:58,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686594603] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:06:58,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598410299] [2023-11-29 04:06:58,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:06:58,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:06:58,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:06:58,593 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:06:58,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-11-29 04:06:59,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 04:06:59,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:06:59,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 04:06:59,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:06:59,140 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 40 treesize of output 19 [2023-11-29 04:06:59,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 17 [2023-11-29 04:06:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2023-11-29 04:06:59,839 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:06:59,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598410299] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:06:59,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:06:59,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [23] total 29 [2023-11-29 04:06:59,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5332443] [2023-11-29 04:06:59,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:06:59,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:06:59,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:06:59,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:06:59,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2023-11-29 04:06:59,840 INFO L87 Difference]: Start difference. First operand 522 states and 673 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 04:07:05,955 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 04:07:06,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:07:06,531 INFO L93 Difference]: Finished difference Result 733 states and 961 transitions. [2023-11-29 04:07:06,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:07:06,531 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 144 [2023-11-29 04:07:06,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:07:06,534 INFO L225 Difference]: With dead ends: 733 [2023-11-29 04:07:06,535 INFO L226 Difference]: Without dead ends: 530 [2023-11-29 04:07:06,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=101, Invalid=955, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 04:07:06,536 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 100 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:07:06,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 793 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 533 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2023-11-29 04:07:06,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2023-11-29 04:07:06,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 524. [2023-11-29 04:07:06,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 359 states have (on average 1.15041782729805) internal successors, (413), 371 states have internal predecessors, (413), 119 states have call successors, (119), 43 states have call predecessors, (119), 45 states have return successors, (142), 109 states have call predecessors, (142), 115 states have call successors, (142) [2023-11-29 04:07:06,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 674 transitions. [2023-11-29 04:07:06,633 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 674 transitions. Word has length 144 [2023-11-29 04:07:06,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:07:06,633 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 674 transitions. [2023-11-29 04:07:06,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 04:07:06,633 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 674 transitions. [2023-11-29 04:07:06,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-29 04:07:06,635 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:07:06,635 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 04:07:06,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-11-29 04:07:06,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-29 04:07:06,836 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:07:06,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:07:06,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1529041313, now seen corresponding path program 1 times [2023-11-29 04:07:06,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:07:06,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344562914] [2023-11-29 04:07:06,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:07:06,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:07:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:07,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:07:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:07,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:07:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:07,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:07:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:07,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:07:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:07,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:07:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:07,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:07:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:07,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 04:07:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:07,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:07:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:07,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 04:07:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:07,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 04:07:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:07,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 04:07:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:07,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:07:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:07,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 04:07:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:07,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 04:07:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:07,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:07:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:07,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-29 04:07:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:07,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 04:07:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:07,405 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-11-29 04:07:07,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:07:07,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344562914] [2023-11-29 04:07:07,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344562914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:07:07,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:07:07,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 04:07:07,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730348517] [2023-11-29 04:07:07,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:07:07,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:07:07,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:07:07,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:07:07,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:07:07,407 INFO L87 Difference]: Start difference. First operand 524 states and 674 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 6 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2023-11-29 04:07:08,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:07:08,508 INFO L93 Difference]: Finished difference Result 733 states and 962 transitions. [2023-11-29 04:07:08,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:07:08,509 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 6 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 144 [2023-11-29 04:07:08,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:07:08,512 INFO L225 Difference]: With dead ends: 733 [2023-11-29 04:07:08,512 INFO L226 Difference]: Without dead ends: 526 [2023-11-29 04:07:08,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2023-11-29 04:07:08,514 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 123 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:07:08,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 404 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 04:07:08,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2023-11-29 04:07:08,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 519. [2023-11-29 04:07:08,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 354 states have (on average 1.1497175141242937) internal successors, (407), 366 states have internal predecessors, (407), 119 states have call successors, (119), 43 states have call predecessors, (119), 45 states have return successors, (142), 109 states have call predecessors, (142), 115 states have call successors, (142) [2023-11-29 04:07:08,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 668 transitions. [2023-11-29 04:07:08,653 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 668 transitions. Word has length 144 [2023-11-29 04:07:08,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:07:08,653 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 668 transitions. [2023-11-29 04:07:08,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 6 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2023-11-29 04:07:08,653 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 668 transitions. [2023-11-29 04:07:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 04:07:08,655 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:07:08,655 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 04:07:08,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 04:07:08,655 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:07:08,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:07:08,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1072791112, now seen corresponding path program 1 times [2023-11-29 04:07:08,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:07:08,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589322368] [2023-11-29 04:07:08,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:07:08,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:07:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:08,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:07:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:08,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:07:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:08,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:07:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:08,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:07:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:08,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:07:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:08,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:07:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:08,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:07:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:08,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:07:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:08,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:07:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:08,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:07:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:08,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:07:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:08,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 04:07:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:08,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 04:07:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:08,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 04:07:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:09,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:07:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:09,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 04:07:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:09,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 04:07:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2023-11-29 04:07:09,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:07:09,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589322368] [2023-11-29 04:07:09,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589322368] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:07:09,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:07:09,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:07:09,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574829509] [2023-11-29 04:07:09,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:07:09,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:07:09,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:07:09,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:07:09,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:07:09,042 INFO L87 Difference]: Start difference. First operand 519 states and 668 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 7 states have internal predecessors, (55), 5 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-11-29 04:07:09,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:07:09,815 INFO L93 Difference]: Finished difference Result 613 states and 792 transitions. [2023-11-29 04:07:09,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:07:09,815 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 7 states have internal predecessors, (55), 5 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 146 [2023-11-29 04:07:09,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:07:09,817 INFO L225 Difference]: With dead ends: 613 [2023-11-29 04:07:09,817 INFO L226 Difference]: Without dead ends: 510 [2023-11-29 04:07:09,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-11-29 04:07:09,818 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 74 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:07:09,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 343 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 04:07:09,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2023-11-29 04:07:09,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2023-11-29 04:07:09,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 346 states have (on average 1.1502890173410405) internal successors, (398), 357 states have internal predecessors, (398), 119 states have call successors, (119), 43 states have call predecessors, (119), 44 states have return successors, (141), 109 states have call predecessors, (141), 115 states have call successors, (141) [2023-11-29 04:07:09,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 658 transitions. [2023-11-29 04:07:09,928 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 658 transitions. Word has length 146 [2023-11-29 04:07:09,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:07:09,928 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 658 transitions. [2023-11-29 04:07:09,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 7 states have internal predecessors, (55), 5 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-11-29 04:07:09,929 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 658 transitions. [2023-11-29 04:07:09,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 04:07:09,930 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:07:09,931 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 04:07:09,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 04:07:09,931 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:07:09,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:07:09,931 INFO L85 PathProgramCache]: Analyzing trace with hash 882534336, now seen corresponding path program 1 times [2023-11-29 04:07:09,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:07:09,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933198792] [2023-11-29 04:07:09,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:07:09,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:07:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:10,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:07:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:11,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:07:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:11,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:07:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:11,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:07:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:07:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:07:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:07:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:07:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:07:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:07:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:07:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 04:07:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 04:07:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 04:07:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:07:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 04:07:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 04:07:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,174 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2023-11-29 04:07:12,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:07:12,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933198792] [2023-11-29 04:07:12,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933198792] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:07:12,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025405152] [2023-11-29 04:07:12,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:07:12,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:07:12,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:07:12,175 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:07:12,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-11-29 04:07:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:12,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 04:07:12,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:07:13,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2023-11-29 04:07:13,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-11-29 04:07:13,548 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2023-11-29 04:07:13,548 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:07:13,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025405152] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:07:13,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:07:13,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 26 [2023-11-29 04:07:13,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629614791] [2023-11-29 04:07:13,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:07:13,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:07:13,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:07:13,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:07:13,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2023-11-29 04:07:13,550 INFO L87 Difference]: Start difference. First operand 510 states and 658 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 6 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2023-11-29 04:07:15,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:07:15,148 INFO L93 Difference]: Finished difference Result 599 states and 780 transitions. [2023-11-29 04:07:15,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 04:07:15,148 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 6 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 146 [2023-11-29 04:07:15,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:07:15,151 INFO L225 Difference]: With dead ends: 599 [2023-11-29 04:07:15,151 INFO L226 Difference]: Without dead ends: 514 [2023-11-29 04:07:15,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=97, Invalid=959, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 04:07:15,152 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 104 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:07:15,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1253 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 04:07:15,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2023-11-29 04:07:15,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 510. [2023-11-29 04:07:15,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 346 states have (on average 1.1502890173410405) internal successors, (398), 357 states have internal predecessors, (398), 119 states have call successors, (119), 43 states have call predecessors, (119), 44 states have return successors, (141), 109 states have call predecessors, (141), 115 states have call successors, (141) [2023-11-29 04:07:15,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 658 transitions. [2023-11-29 04:07:15,239 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 658 transitions. Word has length 146 [2023-11-29 04:07:15,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:07:15,239 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 658 transitions. [2023-11-29 04:07:15,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 6 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2023-11-29 04:07:15,240 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 658 transitions. [2023-11-29 04:07:15,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 04:07:15,241 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:07:15,241 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 04:07:15,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-11-29 04:07:15,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:07:15,442 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:07:15,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:07:15,442 INFO L85 PathProgramCache]: Analyzing trace with hash -61673862, now seen corresponding path program 1 times [2023-11-29 04:07:15,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:07:15,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76516584] [2023-11-29 04:07:15,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:07:15,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:07:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:15,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:07:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:15,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:07:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:15,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:07:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:15,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:07:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:15,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:07:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:15,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:07:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:15,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:07:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:15,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:07:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:15,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:07:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:15,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:07:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:15,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:07:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:15,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 04:07:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:15,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 04:07:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:15,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 04:07:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:16,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:07:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:16,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 04:07:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:16,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 04:07:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2023-11-29 04:07:16,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:07:16,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76516584] [2023-11-29 04:07:16,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76516584] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:07:16,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:07:16,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 04:07:16,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559061320] [2023-11-29 04:07:16,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:07:16,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:07:16,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:07:16,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:07:16,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:07:16,085 INFO L87 Difference]: Start difference. First operand 510 states and 658 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 10 states have internal predecessors, (55), 6 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2023-11-29 04:07:17,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:07:17,161 INFO L93 Difference]: Finished difference Result 602 states and 787 transitions. [2023-11-29 04:07:17,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:07:17,162 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 10 states have internal predecessors, (55), 6 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 146 [2023-11-29 04:07:17,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:07:17,164 INFO L225 Difference]: With dead ends: 602 [2023-11-29 04:07:17,164 INFO L226 Difference]: Without dead ends: 517 [2023-11-29 04:07:17,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2023-11-29 04:07:17,165 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 105 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:07:17,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 458 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 04:07:17,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2023-11-29 04:07:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 507. [2023-11-29 04:07:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 343 states have (on average 1.151603498542274) internal successors, (395), 354 states have internal predecessors, (395), 119 states have call successors, (119), 43 states have call predecessors, (119), 44 states have return successors, (141), 109 states have call predecessors, (141), 115 states have call successors, (141) [2023-11-29 04:07:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 655 transitions. [2023-11-29 04:07:17,252 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 655 transitions. Word has length 146 [2023-11-29 04:07:17,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:07:17,252 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 655 transitions. [2023-11-29 04:07:17,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 10 states have internal predecessors, (55), 6 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2023-11-29 04:07:17,252 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 655 transitions. [2023-11-29 04:07:17,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-29 04:07:17,254 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:07:17,254 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 04:07:17,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-29 04:07:17,254 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:07:17,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:07:17,254 INFO L85 PathProgramCache]: Analyzing trace with hash -333154956, now seen corresponding path program 3 times [2023-11-29 04:07:17,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:07:17,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101459418] [2023-11-29 04:07:17,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:07:17,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:07:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:19,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:07:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:20,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:07:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:20,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:07:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:20,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:07:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:27,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:07:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:27,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:07:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:27,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:07:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:28,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:07:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:28,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 04:07:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:28,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 04:07:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:28,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 04:07:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:28,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 04:07:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:28,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 04:07:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:28,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 04:07:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:28,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 04:07:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:28,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:07:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:28,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 04:07:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:28,174 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 3 proven. 79 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-29 04:07:28,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:07:28,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101459418] [2023-11-29 04:07:28,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101459418] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:07:28,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195939976] [2023-11-29 04:07:28,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:07:28,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:07:28,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:07:28,176 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:07:28,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51fdd7a-7a0d-45fd-ae09-8dcc63198fcb/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-11-29 04:07:39,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-29 04:07:39,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:07:39,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 204 conjunts are in the unsatisfiable core [2023-11-29 04:07:39,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:07:39,543 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 10 treesize of output 8 [2023-11-29 04:07:39,821 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 04:07:39,837 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 04:07:39,838 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 04:07:39,846 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 04:07:39,982 INFO L349 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2023-11-29 04:07:39,982 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 39 treesize of output 36 [2023-11-29 04:07:40,038 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 19 treesize of output 17 [2023-11-29 04:07:40,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:07:40,081 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 26 treesize of output 21 [2023-11-29 04:07:40,251 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-11-29 04:07:40,251 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 1 case distinctions, treesize of input 16 treesize of output 17 [2023-11-29 04:07:40,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 70 [2023-11-29 04:07:40,273 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 0 case distinctions, treesize of input 120 treesize of output 116 [2023-11-29 04:07:40,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 82 [2023-11-29 04:07:40,648 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-29 04:07:40,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 74 treesize of output 78 [2023-11-29 04:07:40,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 54 treesize of output 59 [2023-11-29 04:07:40,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-11-29 04:07:40,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-11-29 04:07:40,904 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 0 case distinctions, treesize of input 14 treesize of output 17 [2023-11-29 04:07:41,033 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 04:07:41,047 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:07:41,047 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 14 treesize of output 19 [2023-11-29 04:07:41,063 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 13 treesize of output 1 [2023-11-29 04:07:41,352 INFO L349 Elim1Store]: treesize reduction 71, result has 24.5 percent of original size [2023-11-29 04:07:41,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 174 treesize of output 216 [2023-11-29 04:07:41,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 75 treesize of output 80 [2023-11-29 04:07:41,419 INFO L349 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-11-29 04:07:41,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 73 treesize of output 85 [2023-11-29 04:07:41,438 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 10 treesize of output 9 [2023-11-29 04:07:41,476 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 04:07:41,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 9 [2023-11-29 04:07:41,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:07:41,695 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 19 treesize of output 23 [2023-11-29 04:07:41,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:07:41,979 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-11-29 04:07:41,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 39 [2023-11-29 04:07:41,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:07:42,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:07:42,006 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 32 [2023-11-29 04:07:42,036 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 23 treesize of output 17 [2023-11-29 04:07:42,150 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 25 treesize of output 19 [2023-11-29 04:07:43,624 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 38 treesize of output 26 [2023-11-29 04:07:43,666 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 9 treesize of output 7 [2023-11-29 04:07:43,680 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 45 treesize of output 31 [2023-11-29 04:07:43,683 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 38 treesize of output 26 [2023-11-29 04:07:43,805 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 37 treesize of output 25 [2023-11-29 04:07:43,809 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 30 treesize of output 20 [2023-11-29 04:07:43,824 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 9 treesize of output 7 [2023-11-29 04:07:43,837 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 30 treesize of output 20 [2023-11-29 04:07:47,945 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (and (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (|v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|))) (and (= (select .cse0 24) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|) (= (select .cse0 v_ensure_linked_list_is_allocated_~curr~0.offset_65) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|) (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse3 (select v_DerPreprocessor_13 24))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse3)) (.cse4 (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_14) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| v_DerPreprocessor_15) .cse3))) (and (exists ((v_DerPreprocessor_12 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_12) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| v_DerPreprocessor_13) .cse3))) (and (= .cse1 .cse2) (= v_DerPreprocessor_12 .cse2)))) (= .cse1 .cse4) (= .cse3 (select v_DerPreprocessor_15 24)) (= v_DerPreprocessor_14 .cse4))))) (<= (+ 2 |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|)))) (<= (+ (select .cse5 24) 3) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (<= (+ 2 (select .cse5 0)) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (and (<= (+ (select .cse6 24) 3) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (<= (+ 2 (select .cse6 0)) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_DerPreprocessor_17 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_17) 24))) (and (= v_DerPreprocessor_17 .cse7) (= .cse7 (select (select |c_#memory_$Pointer$#1.base| .cse7) v_ensure_linked_list_is_allocated_~curr~0.offset_65)) (<= (+ .cse7 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (and (<= (+ (select .cse8 24) 3) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (<= (+ 2 (select .cse8 0)) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_arrayElimCell_103 Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_103))) (and (= (select .cse9 v_ensure_linked_list_is_allocated_~curr~0.offset_65) v_arrayElimCell_103) (= v_arrayElimCell_103 (select .cse9 24)) (<= (+ 2 v_arrayElimCell_103) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse16 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (let ((.cse10 (select .cse16 24))) (and (<= (+ .cse10 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (|v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|))) (and (<= |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| .cse10) (= (select .cse11 24) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|) (= (select .cse11 v_ensure_linked_list_is_allocated_~curr~0.offset_65) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|) (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse14 (select v_DerPreprocessor_13 24))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse14)) (.cse15 (select (store (store |c_#memory_$Pointer$#1.base| .cse14 v_DerPreprocessor_14) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| v_DerPreprocessor_15) .cse14))) (and (exists ((v_DerPreprocessor_12 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_$Pointer$#1.base| .cse14 v_DerPreprocessor_12) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| v_DerPreprocessor_13) .cse14))) (and (= .cse12 .cse13) (= v_DerPreprocessor_12 .cse13)))) (= .cse12 .cse15) (= .cse14 (select v_DerPreprocessor_15 24)) (= v_DerPreprocessor_14 .cse15)))))))) (<= (select .cse16 0) .cse10))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (let ((.cse17 (select .cse19 24))) (and (<= (+ .cse17 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_DerPreprocessor_16 Int)) (let ((.cse18 (select (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_16) 24))) (and (<= .cse18 .cse17) (= v_DerPreprocessor_16 .cse18) (= (select (select |c_#memory_$Pointer$#1.base| .cse18) v_ensure_linked_list_is_allocated_~curr~0.offset_65) .cse18)))) (<= (select .cse19 0) .cse17))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse22 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (let ((.cse20 (select .cse22 24))) (and (<= (+ .cse20 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_arrayElimCell_96 Int)) (let ((.cse21 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_96))) (and (= (select .cse21 24) v_arrayElimCell_96) (<= v_arrayElimCell_96 .cse20) (= v_arrayElimCell_96 (select .cse21 v_ensure_linked_list_is_allocated_~curr~0.offset_65))))) (<= (select .cse22 0) .cse20))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse23 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (and (<= (+ (select .cse23 24) 3) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_arrayElimCell_101 Int)) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_101))) (and (<= (+ 2 v_arrayElimCell_101) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (= (select .cse24 24) v_arrayElimCell_101) (= (select .cse24 v_ensure_linked_list_is_allocated_~curr~0.offset_65) v_arrayElimCell_101)))) (<= (+ 2 (select .cse23 0)) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| Int) (|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse26 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|) 24)) (.cse25 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (and (<= (+ (select .cse25 24) 3) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (not (= .cse26 |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|)) (<= (+ .cse26 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (<= (+ 2 (select .cse25 0)) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse28 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (let ((.cse27 (select .cse28 24))) (and (<= (+ .cse27 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (<= (select .cse28 0) .cse27) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_arrayElimCell_99 Int)) (let ((.cse29 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_99))) (and (= (select .cse29 24) v_arrayElimCell_99) (<= v_arrayElimCell_99 .cse27) (= (select .cse29 v_ensure_linked_list_is_allocated_~curr~0.offset_65) v_arrayElimCell_99)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| Int) (|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse32 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (let ((.cse30 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|) 24)) (.cse31 (select .cse32 24))) (and (<= .cse30 .cse31) (<= (+ .cse31 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (not (= .cse30 |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|)) (<= (select .cse32 0) .cse31)))))) is different from true [2023-11-29 04:08:09,922 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse33 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base|))) (and (not (= |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| |c_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base|) 16) 0) (= |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.offset| 0) (or (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (and (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (|v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|))) (and (= (select .cse0 24) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|) (= (select .cse0 v_ensure_linked_list_is_allocated_~curr~0.offset_65) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|) (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse3 (select v_DerPreprocessor_13 24))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse3)) (.cse4 (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_14) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| v_DerPreprocessor_15) .cse3))) (and (exists ((v_DerPreprocessor_12 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_12) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| v_DerPreprocessor_13) .cse3))) (and (= .cse1 .cse2) (= v_DerPreprocessor_12 .cse2)))) (= .cse1 .cse4) (= .cse3 (select v_DerPreprocessor_15 24)) (= v_DerPreprocessor_14 .cse4))))) (<= (+ 2 |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|)))) (<= (+ (select .cse5 24) 3) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (<= (+ 2 (select .cse5 0)) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (and (<= (+ (select .cse6 24) 3) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (<= (+ 2 (select .cse6 0)) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_DerPreprocessor_17 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_17) 24))) (and (= v_DerPreprocessor_17 .cse7) (= .cse7 (select (select |c_#memory_$Pointer$#1.base| .cse7) v_ensure_linked_list_is_allocated_~curr~0.offset_65)) (<= (+ .cse7 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (and (<= (+ (select .cse8 24) 3) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (<= (+ 2 (select .cse8 0)) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_arrayElimCell_103 Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_103))) (and (= (select .cse9 v_ensure_linked_list_is_allocated_~curr~0.offset_65) v_arrayElimCell_103) (= v_arrayElimCell_103 (select .cse9 24)) (<= (+ 2 v_arrayElimCell_103) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse16 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (let ((.cse10 (select .cse16 24))) (and (<= (+ .cse10 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (|v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|))) (and (<= |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| .cse10) (= (select .cse11 24) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|) (= (select .cse11 v_ensure_linked_list_is_allocated_~curr~0.offset_65) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|) (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse14 (select v_DerPreprocessor_13 24))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse14)) (.cse15 (select (store (store |c_#memory_$Pointer$#1.base| .cse14 v_DerPreprocessor_14) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| v_DerPreprocessor_15) .cse14))) (and (exists ((v_DerPreprocessor_12 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_$Pointer$#1.base| .cse14 v_DerPreprocessor_12) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| v_DerPreprocessor_13) .cse14))) (and (= .cse12 .cse13) (= v_DerPreprocessor_12 .cse13)))) (= .cse12 .cse15) (= .cse14 (select v_DerPreprocessor_15 24)) (= v_DerPreprocessor_14 .cse15)))))))) (<= (select .cse16 0) .cse10))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (let ((.cse17 (select .cse19 24))) (and (<= (+ .cse17 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_DerPreprocessor_16 Int)) (let ((.cse18 (select (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_16) 24))) (and (<= .cse18 .cse17) (= v_DerPreprocessor_16 .cse18) (= (select (select |c_#memory_$Pointer$#1.base| .cse18) v_ensure_linked_list_is_allocated_~curr~0.offset_65) .cse18)))) (<= (select .cse19 0) .cse17))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse22 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (let ((.cse20 (select .cse22 24))) (and (<= (+ .cse20 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_arrayElimCell_96 Int)) (let ((.cse21 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_96))) (and (= (select .cse21 24) v_arrayElimCell_96) (<= v_arrayElimCell_96 .cse20) (= v_arrayElimCell_96 (select .cse21 v_ensure_linked_list_is_allocated_~curr~0.offset_65))))) (<= (select .cse22 0) .cse20))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse23 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (and (<= (+ (select .cse23 24) 3) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_arrayElimCell_101 Int)) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_101))) (and (<= (+ 2 v_arrayElimCell_101) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (= (select .cse24 24) v_arrayElimCell_101) (= (select .cse24 v_ensure_linked_list_is_allocated_~curr~0.offset_65) v_arrayElimCell_101)))) (<= (+ 2 (select .cse23 0)) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| Int) (|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse26 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|) 24)) (.cse25 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (and (<= (+ (select .cse25 24) 3) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (not (= .cse26 |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|)) (<= (+ .cse26 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (<= (+ 2 (select .cse25 0)) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse28 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (let ((.cse27 (select .cse28 24))) (and (<= (+ .cse27 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (<= (select .cse28 0) .cse27) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_arrayElimCell_99 Int)) (let ((.cse29 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_99))) (and (= (select .cse29 24) v_arrayElimCell_99) (<= v_arrayElimCell_99 .cse27) (= (select .cse29 v_ensure_linked_list_is_allocated_~curr~0.offset_65) v_arrayElimCell_99)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| Int) (|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse32 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (let ((.cse30 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|) 24)) (.cse31 (select .cse32 24))) (and (<= .cse30 .cse31) (<= (+ .cse31 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (not (= .cse30 |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|)) (<= (select .cse32 0) .cse31)))))) (= (select .cse33 16) 0) (= |c_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.offset| 0) (let ((.cse45 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base|))) (let ((.cse40 (select .cse45 24))) (let ((.cse38 (= |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| .cse40)) (.cse44 (select .cse33 0)) (.cse39 (select .cse33 24))) (let ((.cse34 (<= (+ .cse39 2) |c_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base|)) (.cse37 (<= .cse44 .cse39)) (.cse35 (or (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse47 (select v_DerPreprocessor_13 24))) (let ((.cse46 (select (store (store |c_#memory_$Pointer$#1.base| .cse47 v_DerPreprocessor_14) |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| v_DerPreprocessor_15) .cse47))) (and (= .cse46 (select |c_#memory_$Pointer$#1.base| .cse47)) (= .cse46 v_DerPreprocessor_14) (= |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| .cse47) (exists ((v_DerPreprocessor_12 (Array Int Int))) (= (select (store (store |c_#memory_$Pointer$#1.base| .cse47 v_DerPreprocessor_12) |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| v_DerPreprocessor_13) .cse47) v_DerPreprocessor_12)))))) (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse51 (select v_DerPreprocessor_13 24))) (let ((.cse48 (select (store (store |c_#memory_$Pointer$#1.base| .cse51 v_DerPreprocessor_14) |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| v_DerPreprocessor_15) .cse51)) (.cse49 (select |c_#memory_$Pointer$#1.base| .cse51))) (and (= .cse48 .cse49) (= .cse48 v_DerPreprocessor_14) (exists ((v_DerPreprocessor_12 (Array Int Int))) (let ((.cse50 (select (store (store |c_#memory_$Pointer$#1.base| .cse51 v_DerPreprocessor_12) |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| v_DerPreprocessor_13) .cse51))) (and (= .cse50 .cse49) (= .cse50 v_DerPreprocessor_12)))) (= .cse51 (select v_DerPreprocessor_15 24)))))) (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse52 (select v_DerPreprocessor_13 24))) (and (= (select (store (store |c_#memory_$Pointer$#1.base| .cse52 v_DerPreprocessor_14) |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| v_DerPreprocessor_15) .cse52) v_DerPreprocessor_14) (= |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| .cse52) (exists ((v_DerPreprocessor_12 (Array Int Int))) (let ((.cse53 (select (store (store |c_#memory_$Pointer$#1.base| .cse52 v_DerPreprocessor_12) |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| v_DerPreprocessor_13) .cse52))) (and (= .cse53 (select |c_#memory_$Pointer$#1.base| .cse52)) (= .cse53 v_DerPreprocessor_12)))) (= .cse52 (select v_DerPreprocessor_15 24))))) (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse54 (select v_DerPreprocessor_13 24))) (and (= (select (store (store |c_#memory_$Pointer$#1.base| .cse54 v_DerPreprocessor_14) |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| v_DerPreprocessor_15) .cse54) v_DerPreprocessor_14) (= |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| .cse54) (= .cse54 (select v_DerPreprocessor_15 24)) (exists ((v_DerPreprocessor_12 (Array Int Int))) (= (select (store (store |c_#memory_$Pointer$#1.base| .cse54 v_DerPreprocessor_12) |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| v_DerPreprocessor_13) .cse54) v_DerPreprocessor_12))))))) (.cse36 (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int)) (= (select .cse45 v_ensure_linked_list_is_allocated_~curr~0.offset_65) |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base|))) (.cse42 (<= (+ .cse44 2) |c_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base|)) (.cse41 (not .cse38)) (.cse43 (<= (+ .cse39 3) |c_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base|))) (or (and .cse34 .cse35 .cse36 .cse37 .cse38 (<= |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| .cse39)) (and .cse34 .cse37 (<= .cse40 .cse39) .cse41) (and .cse35 .cse36 (<= (+ |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| 2) |c_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base|) .cse38 .cse42 .cse43) (and (<= (+ .cse40 2) |c_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base|) .cse42 .cse41 .cse43)))))))) is different from true [2023-11-29 04:08:10,171 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 38 treesize of output 26 [2023-11-29 04:08:10,186 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 45 treesize of output 31 [2023-11-29 04:08:10,189 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 38 treesize of output 26 [2023-11-29 04:08:10,209 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 9 treesize of output 7 [2023-11-29 04:08:10,255 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 37 treesize of output 25 [2023-11-29 04:08:10,258 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 30 treesize of output 20 [2023-11-29 04:08:10,293 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 9 treesize of output 7 [2023-11-29 04:08:10,306 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 30 treesize of output 20 [2023-11-29 04:08:21,770 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 37 treesize of output 25 [2023-11-29 04:08:21,774 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 30 treesize of output 20 [2023-11-29 04:08:21,790 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 9 treesize of output 7 [2023-11-29 04:08:21,805 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 30 treesize of output 20 [2023-11-29 04:08:21,860 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 38 treesize of output 26 [2023-11-29 04:08:21,878 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 9 treesize of output 7 [2023-11-29 04:08:21,925 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 45 treesize of output 31 [2023-11-29 04:08:21,929 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 38 treesize of output 26 [2023-11-29 04:09:09,842 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 83 treesize of output 63 [2023-11-29 04:09:09,896 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 90 treesize of output 68 [2023-11-29 04:09:09,900 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 83 treesize of output 63 [2023-11-29 04:09:09,925 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 9 treesize of output 7 [2023-11-29 04:09:10,098 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 81 treesize of output 61 [2023-11-29 04:09:10,119 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 88 treesize of output 66 [2023-11-29 04:09:10,124 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 81 treesize of output 61 [2023-11-29 04:09:10,184 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 9 treesize of output 7 [2023-11-29 04:09:19,266 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse66 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base|)) (.cse69 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base|))) (and (not (= |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| |c_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base|)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|))) (let ((.cse0 (select .cse1 24))) (and (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|) 16) 0) (<= (select .cse1 0) .cse0) (= (select .cse1 16) 0) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (|v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_52| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_52|))) (and (= (select .cse2 v_ensure_linked_list_is_allocated_~curr~0.offset_65) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_52|) (= (select .cse2 24) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_52|) (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse4 (select v_DerPreprocessor_13 24))) (let ((.cse3 (select (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_14) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_52| v_DerPreprocessor_15) .cse4)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse4))) (and (= v_DerPreprocessor_14 .cse3) (= .cse4 (select v_DerPreprocessor_15 24)) (= .cse5 .cse3) (exists ((v_DerPreprocessor_12 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_12) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_52| v_DerPreprocessor_13) .cse4))) (and (= .cse5 .cse6) (= v_DerPreprocessor_12 .cse6)))))))) (<= |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_52| .cse0)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23| Int)) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|))) (let ((.cse7 (select .cse8 24))) (and (<= (+ 2 .cse7) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|) 16) 0) (<= (select .cse8 0) .cse7) (= (select .cse8 16) 0) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_arrayElimCell_106 Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_106))) (and (= (select .cse9 24) v_arrayElimCell_106) (= (select .cse9 v_ensure_linked_list_is_allocated_~curr~0.offset_65) v_arrayElimCell_106) (<= v_arrayElimCell_106 .cse7)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|))) (let ((.cse10 (select .cse11 24))) (and (<= (+ 2 .cse10) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|) 16) 0) (<= (select .cse11 0) .cse10) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_52| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_52|) 24))) (and (not (= |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_52|)) (<= .cse12 .cse10) (not (= .cse12 |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_52|))))) (= (select .cse11 16) 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|) 16) 0) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_52| Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_52|) 24))) (and (<= (+ 2 .cse13) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|) (not (= |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_52|)) (not (= .cse13 |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_52|))))) (<= (+ (select .cse14 0) 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|) (= (select .cse14 16) 0) (<= (+ 3 (select .cse14 24)) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23| Int)) (let ((.cse16 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|))) (let ((.cse15 (select .cse16 24))) (and (<= (+ 2 .cse15) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|) 16) 0) (<= (select .cse16 0) .cse15) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_DerPreprocessor_18 Int)) (let ((.cse17 (select (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_18) 24))) (and (= v_DerPreprocessor_18 .cse17) (= (select (select |c_#memory_$Pointer$#1.base| .cse17) v_ensure_linked_list_is_allocated_~curr~0.offset_65) .cse17) (<= .cse17 .cse15)))) (= (select .cse16 16) 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|) 16) 0) (exists ((v_arrayElimCell_109 Int) (v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int)) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_109))) (and (= (select .cse18 v_ensure_linked_list_is_allocated_~curr~0.offset_65) v_arrayElimCell_109) (= (select .cse18 24) v_arrayElimCell_109) (<= (+ 2 v_arrayElimCell_109) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|)))) (<= (+ (select .cse19 0) 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|) (= (select .cse19 16) 0) (<= (+ 3 (select .cse19 24)) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|) 16) 0) (<= (+ (select .cse20 0) 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|) (= (select .cse20 16) 0) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_arrayElimCell_111 Int)) (let ((.cse21 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_111))) (and (= (select .cse21 24) v_arrayElimCell_111) (<= (+ 2 v_arrayElimCell_111) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|) (= v_arrayElimCell_111 (select .cse21 v_ensure_linked_list_is_allocated_~curr~0.offset_65))))) (<= (+ 3 (select .cse20 24)) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23| Int)) (let ((.cse22 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|) 16) 0) (<= (+ (select .cse22 0) 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|) (= (select .cse22 16) 0) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_DerPreprocessor_19 Int)) (let ((.cse23 (select (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_19) 24))) (and (= v_DerPreprocessor_19 .cse23) (= (select (select |c_#memory_$Pointer$#1.base| .cse23) v_ensure_linked_list_is_allocated_~curr~0.offset_65) .cse23) (<= (+ 2 .cse23) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|)))) (<= (+ 3 (select .cse22 24)) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23| Int)) (let ((.cse29 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|) 16) 0) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (|v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_52| Int)) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_52|))) (and (= (select .cse24 v_ensure_linked_list_is_allocated_~curr~0.offset_65) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_52|) (= (select .cse24 24) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_52|) (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse26 (select v_DerPreprocessor_13 24))) (let ((.cse25 (select (store (store |c_#memory_$Pointer$#1.base| .cse26 v_DerPreprocessor_14) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_52| v_DerPreprocessor_15) .cse26)) (.cse27 (select |c_#memory_$Pointer$#1.base| .cse26))) (and (= v_DerPreprocessor_14 .cse25) (= .cse26 (select v_DerPreprocessor_15 24)) (= .cse27 .cse25) (exists ((v_DerPreprocessor_12 (Array Int Int))) (let ((.cse28 (select (store (store |c_#memory_$Pointer$#1.base| .cse26 v_DerPreprocessor_12) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_52| v_DerPreprocessor_13) .cse26))) (and (= .cse27 .cse28) (= v_DerPreprocessor_12 .cse28)))))))) (<= (+ 2 |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_52|) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|)))) (<= (+ (select .cse29 0) 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|) (= (select .cse29 16) 0) (<= (+ 3 (select .cse29 24)) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23| Int)) (let ((.cse31 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|))) (let ((.cse30 (select .cse31 24))) (and (<= (+ 2 .cse30) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_23|) 16) 0) (<= (select .cse31 0) .cse30) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_arrayElimCell_104 Int)) (let ((.cse32 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_104))) (and (= v_arrayElimCell_104 (select .cse32 v_ensure_linked_list_is_allocated_~curr~0.offset_65)) (= (select .cse32 24) v_arrayElimCell_104) (<= v_arrayElimCell_104 .cse30)))) (= (select .cse31 16) 0)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base|) 16) 0) (= |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.offset| 0) (or (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse38 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (and (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (|v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| Int)) (let ((.cse33 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|))) (and (= (select .cse33 24) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|) (= (select .cse33 v_ensure_linked_list_is_allocated_~curr~0.offset_65) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|) (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse36 (select v_DerPreprocessor_13 24))) (let ((.cse34 (select |c_#memory_$Pointer$#1.base| .cse36)) (.cse37 (select (store (store |c_#memory_$Pointer$#1.base| .cse36 v_DerPreprocessor_14) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| v_DerPreprocessor_15) .cse36))) (and (exists ((v_DerPreprocessor_12 (Array Int Int))) (let ((.cse35 (select (store (store |c_#memory_$Pointer$#1.base| .cse36 v_DerPreprocessor_12) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| v_DerPreprocessor_13) .cse36))) (and (= .cse34 .cse35) (= v_DerPreprocessor_12 .cse35)))) (= .cse34 .cse37) (= .cse36 (select v_DerPreprocessor_15 24)) (= v_DerPreprocessor_14 .cse37))))) (<= (+ 2 |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|)))) (<= (+ (select .cse38 24) 3) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (<= (+ 2 (select .cse38 0)) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse39 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (and (<= (+ (select .cse39 24) 3) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (<= (+ 2 (select .cse39 0)) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_DerPreprocessor_17 Int)) (let ((.cse40 (select (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_17) 24))) (and (= v_DerPreprocessor_17 .cse40) (= .cse40 (select (select |c_#memory_$Pointer$#1.base| .cse40) v_ensure_linked_list_is_allocated_~curr~0.offset_65)) (<= (+ .cse40 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse41 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (and (<= (+ (select .cse41 24) 3) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (<= (+ 2 (select .cse41 0)) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_arrayElimCell_103 Int)) (let ((.cse42 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_103))) (and (= (select .cse42 v_ensure_linked_list_is_allocated_~curr~0.offset_65) v_arrayElimCell_103) (= v_arrayElimCell_103 (select .cse42 24)) (<= (+ 2 v_arrayElimCell_103) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse49 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (let ((.cse43 (select .cse49 24))) (and (<= (+ .cse43 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (|v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| Int)) (let ((.cse44 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|))) (and (<= |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| .cse43) (= (select .cse44 24) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|) (= (select .cse44 v_ensure_linked_list_is_allocated_~curr~0.offset_65) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|) (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse47 (select v_DerPreprocessor_13 24))) (let ((.cse45 (select |c_#memory_$Pointer$#1.base| .cse47)) (.cse48 (select (store (store |c_#memory_$Pointer$#1.base| .cse47 v_DerPreprocessor_14) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| v_DerPreprocessor_15) .cse47))) (and (exists ((v_DerPreprocessor_12 (Array Int Int))) (let ((.cse46 (select (store (store |c_#memory_$Pointer$#1.base| .cse47 v_DerPreprocessor_12) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| v_DerPreprocessor_13) .cse47))) (and (= .cse45 .cse46) (= v_DerPreprocessor_12 .cse46)))) (= .cse45 .cse48) (= .cse47 (select v_DerPreprocessor_15 24)) (= v_DerPreprocessor_14 .cse48)))))))) (<= (select .cse49 0) .cse43))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse52 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (let ((.cse50 (select .cse52 24))) (and (<= (+ .cse50 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_DerPreprocessor_16 Int)) (let ((.cse51 (select (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_16) 24))) (and (<= .cse51 .cse50) (= v_DerPreprocessor_16 .cse51) (= (select (select |c_#memory_$Pointer$#1.base| .cse51) v_ensure_linked_list_is_allocated_~curr~0.offset_65) .cse51)))) (<= (select .cse52 0) .cse50))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse55 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (let ((.cse53 (select .cse55 24))) (and (<= (+ .cse53 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_arrayElimCell_96 Int)) (let ((.cse54 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_96))) (and (= (select .cse54 24) v_arrayElimCell_96) (<= v_arrayElimCell_96 .cse53) (= v_arrayElimCell_96 (select .cse54 v_ensure_linked_list_is_allocated_~curr~0.offset_65))))) (<= (select .cse55 0) .cse53))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse56 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (and (<= (+ (select .cse56 24) 3) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_arrayElimCell_101 Int)) (let ((.cse57 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_101))) (and (<= (+ 2 v_arrayElimCell_101) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (= (select .cse57 24) v_arrayElimCell_101) (= (select .cse57 v_ensure_linked_list_is_allocated_~curr~0.offset_65) v_arrayElimCell_101)))) (<= (+ 2 (select .cse56 0)) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| Int) (|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse59 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|) 24)) (.cse58 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (and (<= (+ (select .cse58 24) 3) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (not (= .cse59 |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|)) (<= (+ .cse59 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (<= (+ 2 (select .cse58 0)) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse61 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (let ((.cse60 (select .cse61 24))) (and (<= (+ .cse60 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (<= (select .cse61 0) .cse60) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_arrayElimCell_99 Int)) (let ((.cse62 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_99))) (and (= (select .cse62 24) v_arrayElimCell_99) (<= v_arrayElimCell_99 .cse60) (= (select .cse62 v_ensure_linked_list_is_allocated_~curr~0.offset_65) v_arrayElimCell_99)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51| Int) (|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| Int)) (let ((.cse65 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|))) (let ((.cse63 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|) 24)) (.cse64 (select .cse65 24))) (and (<= .cse63 .cse64) (<= (+ .cse64 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22|) (not (= .cse63 |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_22| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_51|)) (<= (select .cse65 0) .cse64)))))) (= (select .cse66 16) 0) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134| Int)) (let ((.cse67 (select .cse69 0))) (let ((.cse68 (select (select |c_#memory_$Pointer$#1.base| .cse67) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134|))) (and (= 16 (select (select |c_#memory_$Pointer$#1.offset| .cse67) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134|)) (= .cse67 (select (select |c_#memory_$Pointer$#1.base| .cse68) 24)) (= |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| .cse68))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134| Int)) (let ((.cse74 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54|))) (let ((.cse72 (select .cse74 0))) (let ((.cse70 (select .cse74 24)) (.cse73 (select (select |c_#memory_$Pointer$#1.base| .cse72) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134|))) (and (not (= .cse70 |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54|)) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25| Int)) (let ((.cse71 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|))) (and (<= (+ .cse70 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) (<= (+ (select .cse71 24) 3) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) (<= (+ (select .cse71 0) 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) (= (select .cse71 16) 0) (not (= |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) 16) 0)))) (= .cse72 (select (select |c_#memory_$Pointer$#1.base| .cse73) 24)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse72) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134|) 16) (= |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54| .cse73)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25| Int)) (let ((.cse80 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|))) (let ((.cse78 (select .cse80 24))) (and (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_DerPreprocessor_22 Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134| Int)) (let ((.cse77 (select (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_22) 24))) (let ((.cse79 (select |c_#memory_$Pointer$#1.base| .cse77))) (let ((.cse75 (select .cse79 0))) (let ((.cse76 (select (select |c_#memory_$Pointer$#1.base| .cse75) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134|))) (and (= .cse75 (select (select |c_#memory_$Pointer$#1.base| .cse76) 24)) (= v_DerPreprocessor_22 .cse77) (= .cse76 .cse77) (<= .cse77 .cse78) (= (select .cse79 v_ensure_linked_list_is_allocated_~curr~0.offset_65) .cse77) (= (select (select |c_#memory_$Pointer$#1.offset| .cse75) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134|) 16))))))) (<= (+ .cse78 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) (<= (select .cse80 0) .cse78) (= (select .cse80 16) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) 16) 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25| Int)) (let ((.cse81 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|))) (and (<= (+ (select .cse81 24) 3) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) (<= (+ (select .cse81 0) 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) (= (select .cse81 16) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) 16) 0) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_DerPreprocessor_23 Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134| Int)) (let ((.cse82 (select (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_23) 24))) (let ((.cse85 (select |c_#memory_$Pointer$#1.base| .cse82))) (let ((.cse83 (select .cse85 0))) (let ((.cse84 (select (select |c_#memory_$Pointer$#1.base| .cse83) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134|))) (and (<= (+ 2 .cse82) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse83) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134|) 16) (= .cse83 (select (select |c_#memory_$Pointer$#1.base| .cse84) 24)) (= (select .cse85 v_ensure_linked_list_is_allocated_~curr~0.offset_65) .cse82) (= v_DerPreprocessor_23 .cse82) (= .cse84 .cse82)))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25| Int)) (let ((.cse86 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|))) (and (<= (+ (select .cse86 24) 3) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) (<= (+ (select .cse86 0) 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) (= (select .cse86 16) 0) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_arrayElimCell_126 Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134| Int)) (let ((.cse87 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_126))) (let ((.cse89 (select .cse87 0))) (let ((.cse88 (select (select |c_#memory_$Pointer$#1.base| .cse89) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134|))) (and (= (select .cse87 24) v_arrayElimCell_126) (= v_arrayElimCell_126 .cse88) (<= (+ 2 v_arrayElimCell_126) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) (= (select (select |c_#memory_$Pointer$#1.base| .cse88) 24) .cse89) (= (select .cse87 v_ensure_linked_list_is_allocated_~curr~0.offset_65) v_arrayElimCell_126) (= (select (select |c_#memory_$Pointer$#1.offset| .cse89) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134|) 16)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) 16) 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134| Int)) (let ((.cse95 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54|))) (let ((.cse93 (select .cse95 0))) (let ((.cse90 (select .cse95 24)) (.cse94 (select (select |c_#memory_$Pointer$#1.base| .cse93) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134|))) (and (not (= .cse90 |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54|)) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25| Int)) (let ((.cse92 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|))) (let ((.cse91 (select .cse92 24))) (and (<= (+ .cse91 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) (<= (select .cse92 0) .cse91) (= (select .cse92 16) 0) (not (= |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54|)) (<= .cse90 .cse91) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) 16) 0))))) (= .cse93 (select (select |c_#memory_$Pointer$#1.base| .cse94) 24)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse93) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134|) 16) (= |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54| .cse94)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25| Int)) (let ((.cse104 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|))) (let ((.cse101 (select .cse104 24))) (and (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (|v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134| Int)) (let ((.cse96 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54|))) (let ((.cse102 (select .cse96 0))) (let ((.cse103 (select (select |c_#memory_$Pointer$#1.base| .cse102) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134|))) (and (= (select .cse96 v_ensure_linked_list_is_allocated_~curr~0.offset_65) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54|) (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse99 (select v_DerPreprocessor_13 24))) (let ((.cse98 (select |c_#memory_$Pointer$#1.base| .cse99)) (.cse100 (select (store (store |c_#memory_$Pointer$#1.base| .cse99 v_DerPreprocessor_14) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54| v_DerPreprocessor_15) .cse99))) (and (exists ((v_DerPreprocessor_12 (Array Int Int))) (let ((.cse97 (select (store (store |c_#memory_$Pointer$#1.base| .cse99 v_DerPreprocessor_12) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54| v_DerPreprocessor_13) .cse99))) (and (= v_DerPreprocessor_12 .cse97) (= .cse97 .cse98)))) (= .cse98 .cse100) (= v_DerPreprocessor_14 .cse100) (= .cse99 (select v_DerPreprocessor_15 24)))))) (<= |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54| .cse101) (= .cse102 (select (select |c_#memory_$Pointer$#1.base| .cse103) 24)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse102) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134|) 16) (= |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54| .cse103) (= (select .cse96 24) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54|)))))) (<= (+ .cse101 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) (<= (select .cse104 0) .cse101) (= (select .cse104 16) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) 16) 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25| Int)) (let ((.cse108 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|))) (and (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_arrayElimCell_124 Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134| Int)) (let ((.cse106 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_124))) (let ((.cse107 (select .cse106 0))) (let ((.cse105 (select (select |c_#memory_$Pointer$#1.base| .cse107) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134|))) (and (= .cse105 v_arrayElimCell_124) (= (select .cse106 24) v_arrayElimCell_124) (<= (+ 2 v_arrayElimCell_124) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) (= (select (select |c_#memory_$Pointer$#1.base| .cse105) 24) .cse107) (= (select .cse106 v_ensure_linked_list_is_allocated_~curr~0.offset_65) v_arrayElimCell_124) (= (select (select |c_#memory_$Pointer$#1.offset| .cse107) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134|) 16)))))) (<= (+ (select .cse108 24) 3) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) (<= (+ (select .cse108 0) 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) (= (select .cse108 16) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) 16) 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25| Int)) (let ((.cse109 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|))) (and (<= (+ (select .cse109 24) 3) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) (<= (+ (select .cse109 0) 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (|v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134| Int)) (let ((.cse110 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54|))) (let ((.cse115 (select .cse110 0))) (let ((.cse116 (select (select |c_#memory_$Pointer$#1.base| .cse115) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134|))) (and (<= (+ 2 |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54|) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) (= (select .cse110 v_ensure_linked_list_is_allocated_~curr~0.offset_65) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54|) (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse113 (select v_DerPreprocessor_13 24))) (let ((.cse112 (select |c_#memory_$Pointer$#1.base| .cse113)) (.cse114 (select (store (store |c_#memory_$Pointer$#1.base| .cse113 v_DerPreprocessor_14) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54| v_DerPreprocessor_15) .cse113))) (and (exists ((v_DerPreprocessor_12 (Array Int Int))) (let ((.cse111 (select (store (store |c_#memory_$Pointer$#1.base| .cse113 v_DerPreprocessor_12) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54| v_DerPreprocessor_13) .cse113))) (and (= v_DerPreprocessor_12 .cse111) (= .cse111 .cse112)))) (= .cse112 .cse114) (= v_DerPreprocessor_14 .cse114) (= .cse113 (select v_DerPreprocessor_15 24)))))) (= .cse115 (select (select |c_#memory_$Pointer$#1.base| .cse116) 24)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse115) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134|) 16) (= |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54| .cse116) (= (select .cse110 24) |v_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base_BEFORE_CALL_54|)))))) (= (select .cse109 16) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) 16) 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25| Int)) (let ((.cse118 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|))) (let ((.cse117 (select .cse118 24))) (and (<= (+ .cse117 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) (<= (select .cse118 0) .cse117) (= (select .cse118 16) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) 16) 0) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_arrayElimCell_122 Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134| Int)) (let ((.cse120 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_122))) (let ((.cse119 (select .cse120 0))) (let ((.cse121 (select (select |c_#memory_$Pointer$#1.base| .cse119) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134|))) (and (= 16 (select (select |c_#memory_$Pointer$#1.offset| .cse119) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134|)) (= v_arrayElimCell_122 (select .cse120 24)) (= .cse119 (select (select |c_#memory_$Pointer$#1.base| .cse121) 24)) (= (select .cse120 v_ensure_linked_list_is_allocated_~curr~0.offset_65) v_arrayElimCell_122) (= .cse121 v_arrayElimCell_122) (<= v_arrayElimCell_122 .cse117)))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25| Int)) (let ((.cse123 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|))) (let ((.cse122 (select .cse123 24))) (and (<= (+ .cse122 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) (<= (select .cse123 0) .cse122) (= (select .cse123 16) 0) (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int) (v_arrayElimCell_120 Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134| Int)) (let ((.cse125 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_120))) (let ((.cse126 (select .cse125 0))) (let ((.cse124 (select (select |c_#memory_$Pointer$#1.base| .cse126) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134|))) (and (= v_arrayElimCell_120 .cse124) (= v_arrayElimCell_120 (select .cse125 24)) (<= v_arrayElimCell_120 .cse122) (= v_arrayElimCell_120 (select .cse125 v_ensure_linked_list_is_allocated_~curr~0.offset_65)) (= .cse126 (select (select |c_#memory_$Pointer$#1.base| .cse124) 24)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse126) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_134|) 16)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_25|) 16) 0)))))) (= |c_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.offset| 0) (let ((.cse133 (select .cse69 24))) (let ((.cse131 (= |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| .cse133)) (.cse137 (select .cse66 0)) (.cse132 (select .cse66 24))) (let ((.cse127 (<= (+ .cse132 2) |c_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base|)) (.cse130 (<= .cse137 .cse132)) (.cse128 (or (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse139 (select v_DerPreprocessor_13 24))) (let ((.cse138 (select (store (store |c_#memory_$Pointer$#1.base| .cse139 v_DerPreprocessor_14) |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| v_DerPreprocessor_15) .cse139))) (and (= .cse138 (select |c_#memory_$Pointer$#1.base| .cse139)) (= .cse138 v_DerPreprocessor_14) (= |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| .cse139) (exists ((v_DerPreprocessor_12 (Array Int Int))) (= (select (store (store |c_#memory_$Pointer$#1.base| .cse139 v_DerPreprocessor_12) |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| v_DerPreprocessor_13) .cse139) v_DerPreprocessor_12)))))) (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse143 (select v_DerPreprocessor_13 24))) (let ((.cse140 (select (store (store |c_#memory_$Pointer$#1.base| .cse143 v_DerPreprocessor_14) |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| v_DerPreprocessor_15) .cse143)) (.cse141 (select |c_#memory_$Pointer$#1.base| .cse143))) (and (= .cse140 .cse141) (= .cse140 v_DerPreprocessor_14) (exists ((v_DerPreprocessor_12 (Array Int Int))) (let ((.cse142 (select (store (store |c_#memory_$Pointer$#1.base| .cse143 v_DerPreprocessor_12) |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| v_DerPreprocessor_13) .cse143))) (and (= .cse142 .cse141) (= .cse142 v_DerPreprocessor_12)))) (= .cse143 (select v_DerPreprocessor_15 24)))))) (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse144 (select v_DerPreprocessor_13 24))) (and (= (select (store (store |c_#memory_$Pointer$#1.base| .cse144 v_DerPreprocessor_14) |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| v_DerPreprocessor_15) .cse144) v_DerPreprocessor_14) (= |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| .cse144) (exists ((v_DerPreprocessor_12 (Array Int Int))) (let ((.cse145 (select (store (store |c_#memory_$Pointer$#1.base| .cse144 v_DerPreprocessor_12) |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| v_DerPreprocessor_13) .cse144))) (and (= .cse145 (select |c_#memory_$Pointer$#1.base| .cse144)) (= .cse145 v_DerPreprocessor_12)))) (= .cse144 (select v_DerPreprocessor_15 24))))) (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse146 (select v_DerPreprocessor_13 24))) (and (= (select (store (store |c_#memory_$Pointer$#1.base| .cse146 v_DerPreprocessor_14) |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| v_DerPreprocessor_15) .cse146) v_DerPreprocessor_14) (= |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| .cse146) (= .cse146 (select v_DerPreprocessor_15 24)) (exists ((v_DerPreprocessor_12 (Array Int Int))) (= (select (store (store |c_#memory_$Pointer$#1.base| .cse146 v_DerPreprocessor_12) |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| v_DerPreprocessor_13) .cse146) v_DerPreprocessor_12))))))) (.cse129 (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_65 Int)) (= (select .cse69 v_ensure_linked_list_is_allocated_~curr~0.offset_65) |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base|))) (.cse135 (<= (+ .cse137 2) |c_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base|)) (.cse134 (not .cse131)) (.cse136 (<= (+ .cse132 3) |c_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base|))) (or (and .cse127 .cse128 .cse129 .cse130 .cse131 (<= |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| .cse132)) (and .cse127 .cse130 (<= .cse133 .cse132) .cse134) (and .cse128 .cse129 (<= (+ |c_ULTIMATE.start_aws_linked_list_swap_contents_~b#1.base| 2) |c_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base|) .cse131 .cse135 .cse136) (and (<= (+ .cse133 2) |c_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base|) .cse135 .cse134 .cse136))))))) is different from true [2023-11-29 04:09:26,214 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 81 treesize of output 61 [2023-11-29 04:09:26,236 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 88 treesize of output 66 [2023-11-29 04:09:26,240 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 81 treesize of output 61 [2023-11-29 04:09:26,307 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 9 treesize of output 7 [2023-11-29 04:09:26,522 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 90 treesize of output 68 [2023-11-29 04:09:26,526 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 83 treesize of output 63 [2023-11-29 04:09:26,592 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 9 treesize of output 7