./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness_negated.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB --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 222962222638f0fcfd5888fac8242f8ce08239110602155fe31bfd0578d28673 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:40:44,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:40:44,838 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-28 04:40:44,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:40:44,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:40:44,884 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:40:44,885 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:40:44,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:40:44,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:40:44,887 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:40:44,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:40:44,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:40:44,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:40:44,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:40:44,889 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:40:44,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:40:44,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 04:40:44,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:40:44,891 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:40:44,891 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 04:40:44,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:40:44,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 04:40:44,892 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 04:40:44,892 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:40:44,892 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:40:44,892 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:40:44,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:40:44,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:40:44,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:40:44,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:40:44,893 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:40:44,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:40:44,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:40:44,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:40:44,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:40:44,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:40:44,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:40:44,894 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 04:40:44,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 04:40:44,894 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:40:44,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:40:44,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:40:44,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:40:44,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:40:44,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:40:44,895 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 222962222638f0fcfd5888fac8242f8ce08239110602155fe31bfd0578d28673 [2024-11-28 04:40:45,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:40:45,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:40:45,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:40:45,311 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:40:45,312 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:40:45,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness_negated.i [2024-11-28 04:40:48,436 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/data/0e8141566/b8c93aa2fd6e4bd593b44ff6e4c74e6e/FLAG321b2c191 [2024-11-28 04:40:49,230 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:40:49,231 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness_negated.i [2024-11-28 04:40:49,293 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/data/0e8141566/b8c93aa2fd6e4bd593b44ff6e4c74e6e/FLAG321b2c191 [2024-11-28 04:40:49,323 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/data/0e8141566/b8c93aa2fd6e4bd593b44ff6e4c74e6e [2024-11-28 04:40:49,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:40:49,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:40:49,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:40:49,330 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:40:49,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:40:49,341 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:40:49" (1/1) ... [2024-11-28 04:40:49,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7377ceec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:49, skipping insertion in model container [2024-11-28 04:40:49,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:40:49" (1/1) ... [2024-11-28 04:40:49,448 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:40:49,767 WARN L250 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_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness_negated.i[4493,4506] [2024-11-28 04:40:49,776 WARN L250 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_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness_negated.i[4553,4566] [2024-11-28 04:40:50,948 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:50,951 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:50,952 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:50,953 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:50,954 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:50,981 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:50,985 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:50,988 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:50,990 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:50,993 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:50,997 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:50,998 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:50,998 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:51,892 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:51,893 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:51,901 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:51,917 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:51,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:40:52,066 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:40:52,085 WARN L250 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_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness_negated.i[4493,4506] [2024-11-28 04:40:52,085 WARN L250 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_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness_negated.i[4553,4566] [2024-11-28 04:40:52,198 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:52,199 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:52,200 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:52,200 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:52,201 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:52,218 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:52,218 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:52,224 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:52,224 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:52,225 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:52,226 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:52,226 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:52,227 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:52,357 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:52,358 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:52,359 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:52,365 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-28 04:40:52,374 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7743-7754] [2024-11-28 04:40:52,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:40:52,643 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:40:52,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:52 WrapperNode [2024-11-28 04:40:52,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:40:52,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:40:52,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:40:52,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:40:52,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:52" (1/1) ... [2024-11-28 04:40:52,766 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:52" (1/1) ... [2024-11-28 04:40:52,865 INFO L138 Inliner]: procedures = 680, calls = 1678, calls flagged for inlining = 52, calls inlined = 7, statements flattened = 718 [2024-11-28 04:40:52,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:40:52,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:40:52,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:40:52,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:40:52,880 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:52" (1/1) ... [2024-11-28 04:40:52,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:52" (1/1) ... [2024-11-28 04:40:52,888 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:52" (1/1) ... [2024-11-28 04:40:52,965 INFO L175 MemorySlicer]: Split 313 memory accesses to 5 slices as follows [238, 2, 7, 57, 9]. 76 percent of accesses are in the largest equivalence class. The 24 initializations are split as follows [6, 2, 5, 10, 1]. The 241 writes are split as follows [232, 0, 1, 7, 1]. [2024-11-28 04:40:52,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:52" (1/1) ... [2024-11-28 04:40:52,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:52" (1/1) ... [2024-11-28 04:40:53,042 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:52" (1/1) ... [2024-11-28 04:40:53,044 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:52" (1/1) ... [2024-11-28 04:40:53,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:52" (1/1) ... [2024-11-28 04:40:53,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:52" (1/1) ... [2024-11-28 04:40:53,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:52" (1/1) ... [2024-11-28 04:40:53,094 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:40:53,094 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:40:53,099 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:40:53,099 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:40:53,100 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:52" (1/1) ... [2024-11-28 04:40:53,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:40:53,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:40:53,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:40:53,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:40:53,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 04:40:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2024-11-28 04:40:53,189 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2024-11-28 04:40:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2024-11-28 04:40:53,190 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2024-11-28 04:40:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2024-11-28 04:40:53,191 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2024-11-28 04:40:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2024-11-28 04:40:53,191 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2024-11-28 04:40:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-28 04:40:53,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-28 04:40:53,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-28 04:40:53,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-28 04:40:53,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-28 04:40:53,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 04:40:53,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 04:40:53,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 04:40:53,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-28 04:40:53,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-28 04:40:53,193 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2024-11-28 04:40:53,193 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2024-11-28 04:40:53,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 04:40:53,193 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 04:40:53,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 04:40:53,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:40:53,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 04:40:53,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 04:40:53,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 04:40:53,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-28 04:40:53,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-28 04:40:53,195 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_impl [2024-11-28 04:40:53,195 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_impl [2024-11-28 04:40:53,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:40:53,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:40:53,196 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2024-11-28 04:40:53,196 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2024-11-28 04:40:53,196 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2024-11-28 04:40:53,196 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2024-11-28 04:40:53,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-28 04:40:53,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-28 04:40:53,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-11-28 04:40:53,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-11-28 04:40:53,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-11-28 04:40:53,196 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2024-11-28 04:40:53,196 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2024-11-28 04:40:53,196 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2024-11-28 04:40:53,197 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2024-11-28 04:40:53,197 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-28 04:40:53,197 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-28 04:40:53,197 INFO L130 BoogieDeclarations]: Found specification of procedure my_memcpy [2024-11-28 04:40:53,197 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memcpy [2024-11-28 04:40:53,197 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2024-11-28 04:40:53,197 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2024-11-28 04:40:53,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 04:40:53,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 04:40:53,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 04:40:53,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 04:40:53,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-28 04:40:53,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-28 04:40:53,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-28 04:40:53,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-28 04:40:53,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-28 04:40:53,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-28 04:40:53,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-28 04:40:53,198 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2024-11-28 04:40:53,198 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2024-11-28 04:40:53,198 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2024-11-28 04:40:53,198 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2024-11-28 04:40:53,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 04:40:53,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 04:40:53,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 04:40:53,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-28 04:40:53,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-28 04:40:53,198 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2024-11-28 04:40:53,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2024-11-28 04:40:53,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 04:40:53,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 04:40:53,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 04:40:53,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-28 04:40:53,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-28 04:40:53,559 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:40:53,562 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:41:00,324 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-28 04:41:00,324 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:41:00,351 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:41:00,353 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-28 04:41:00,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:41:00 BoogieIcfgContainer [2024-11-28 04:41:00,353 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:41:00,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:41:00,356 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:41:00,361 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:41:00,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:40:49" (1/3) ... [2024-11-28 04:41:00,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41424faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:41:00, skipping insertion in model container [2024-11-28 04:41:00,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:52" (2/3) ... [2024-11-28 04:41:00,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41424faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:41:00, skipping insertion in model container [2024-11-28 04:41:00,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:41:00" (3/3) ... [2024-11-28 04:41:00,365 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_array_list_copy_harness_negated.i [2024-11-28 04:41:00,384 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:41:00,386 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_array_list_copy_harness_negated.i that has 18 procedures, 209 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-28 04:41:00,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:41:00,477 INFO L333 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, 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;@b359bd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:41:00,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 04:41:00,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 119 states have (on average 1.184873949579832) internal successors, (141), 120 states have internal predecessors, (141), 71 states have call successors, (71), 17 states have call predecessors, (71), 17 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-28 04:41:00,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-28 04:41:00,501 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:41:00,502 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:41:00,503 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:41:00,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:41:00,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1329126664, now seen corresponding path program 1 times [2024-11-28 04:41:00,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:41:00,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391141732] [2024-11-28 04:41:00,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:41:00,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:41:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:41:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-11-28 04:41:09,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:41:09,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391141732] [2024-11-28 04:41:09,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391141732] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:41:09,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864063101] [2024-11-28 04:41:09,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:41:09,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:41:09,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:41:09,282 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:41:09,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:41:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:41:18,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 4363 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 04:41:18,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:41:18,849 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2024-11-28 04:41:18,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:41:18,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864063101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:41:18,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:41:18,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-28 04:41:18,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737510594] [2024-11-28 04:41:18,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:41:18,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 04:41:18,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:41:18,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 04:41:18,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 04:41:18,887 INFO L87 Difference]: Start difference. First operand has 209 states, 119 states have (on average 1.184873949579832) internal successors, (141), 120 states have internal predecessors, (141), 71 states have call successors, (71), 17 states have call predecessors, (71), 17 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-28 04:41:18,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:41:18,961 INFO L93 Difference]: Finished difference Result 414 states and 603 transitions. [2024-11-28 04:41:18,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 04:41:18,964 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 145 [2024-11-28 04:41:18,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:41:18,979 INFO L225 Difference]: With dead ends: 414 [2024-11-28 04:41:18,979 INFO L226 Difference]: Without dead ends: 204 [2024-11-28 04:41:18,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 04:41:18,994 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:41:18,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:41:19,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-28 04:41:19,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-28 04:41:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 115 states have (on average 1.173913043478261) internal successors, (135), 116 states have internal predecessors, (135), 71 states have call successors, (71), 17 states have call predecessors, (71), 17 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-28 04:41:19,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 276 transitions. [2024-11-28 04:41:19,072 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 276 transitions. Word has length 145 [2024-11-28 04:41:19,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:41:19,074 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 276 transitions. [2024-11-28 04:41:19,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-28 04:41:19,075 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 276 transitions. [2024-11-28 04:41:19,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-28 04:41:19,082 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:41:19,085 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:41:19,104 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 04:41:19,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-28 04:41:19,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:41:19,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:41:19,287 INFO L85 PathProgramCache]: Analyzing trace with hash -433130932, now seen corresponding path program 1 times [2024-11-28 04:41:19,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:41:19,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838372152] [2024-11-28 04:41:19,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:41:19,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:41:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:41:26,655 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-28 04:41:26,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:41:26,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838372152] [2024-11-28 04:41:26,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838372152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:41:26,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785860211] [2024-11-28 04:41:26,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:41:26,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:41:26,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:41:26,665 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:41:26,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:41:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:41:34,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 4363 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 04:41:34,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:41:34,640 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-11-28 04:41:34,640 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:41:34,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785860211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:41:34,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:41:34,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-11-28 04:41:34,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685977866] [2024-11-28 04:41:34,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:41:34,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:41:34,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:41:34,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:41:34,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:41:34,644 INFO L87 Difference]: Start difference. First operand 204 states and 276 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-28 04:41:34,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:41:34,722 INFO L93 Difference]: Finished difference Result 403 states and 547 transitions. [2024-11-28 04:41:34,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:41:34,722 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 145 [2024-11-28 04:41:34,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:41:34,726 INFO L225 Difference]: With dead ends: 403 [2024-11-28 04:41:34,726 INFO L226 Difference]: Without dead ends: 205 [2024-11-28 04:41:34,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:41:34,729 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 0 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:41:34,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 546 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:41:34,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-28 04:41:34,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-28 04:41:34,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 116 states have (on average 1.1724137931034482) internal successors, (136), 117 states have internal predecessors, (136), 71 states have call successors, (71), 17 states have call predecessors, (71), 17 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-28 04:41:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 277 transitions. [2024-11-28 04:41:34,759 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 277 transitions. Word has length 145 [2024-11-28 04:41:34,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:41:34,759 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 277 transitions. [2024-11-28 04:41:34,760 INFO L472 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-28 04:41:34,760 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 277 transitions. [2024-11-28 04:41:34,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-28 04:41:34,763 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:41:34,763 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:41:34,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 04:41:34,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:41:34,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:41:34,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:41:34,965 INFO L85 PathProgramCache]: Analyzing trace with hash 995250632, now seen corresponding path program 1 times [2024-11-28 04:41:34,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:41:34,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727472565] [2024-11-28 04:41:34,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:41:34,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:41:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:41:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2024-11-28 04:41:43,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:41:43,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727472565] [2024-11-28 04:41:43,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727472565] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:41:43,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928560861] [2024-11-28 04:41:43,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:41:43,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:41:43,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:41:43,042 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:41:43,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 04:41:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:41:50,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 4369 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 04:41:50,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:41:51,276 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-28 04:41:51,277 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:41:51,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928560861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:41:51,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:41:51,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2024-11-28 04:41:51,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303559699] [2024-11-28 04:41:51,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:41:51,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:41:51,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:41:51,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:41:51,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:41:51,279 INFO L87 Difference]: Start difference. First operand 205 states and 277 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-28 04:41:53,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:41:53,668 INFO L93 Difference]: Finished difference Result 405 states and 558 transitions. [2024-11-28 04:41:53,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:41:53,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 145 [2024-11-28 04:41:53,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:41:53,674 INFO L225 Difference]: With dead ends: 405 [2024-11-28 04:41:53,674 INFO L226 Difference]: Without dead ends: 207 [2024-11-28 04:41:53,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-28 04:41:53,677 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 282 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:41:53,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 779 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 04:41:53,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-28 04:41:53,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-28 04:41:53,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 117 states have (on average 1.170940170940171) internal successors, (137), 119 states have internal predecessors, (137), 71 states have call successors, (71), 17 states have call predecessors, (71), 18 states have return successors, (82), 70 states have call predecessors, (82), 70 states have call successors, (82) [2024-11-28 04:41:53,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 290 transitions. [2024-11-28 04:41:53,719 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 290 transitions. Word has length 145 [2024-11-28 04:41:53,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:41:53,719 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 290 transitions. [2024-11-28 04:41:53,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-28 04:41:53,720 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 290 transitions. [2024-11-28 04:41:53,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-28 04:41:53,723 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:41:53,723 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:41:53,747 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 04:41:53,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:41:53,924 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:41:53,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:41:53,925 INFO L85 PathProgramCache]: Analyzing trace with hash -139108393, now seen corresponding path program 1 times [2024-11-28 04:41:53,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:41:53,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303214757] [2024-11-28 04:41:53,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:41:53,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:01,943 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2024-11-28 04:42:01,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:01,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303214757] [2024-11-28 04:42:01,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303214757] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:42:01,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294898335] [2024-11-28 04:42:01,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:01,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:42:01,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:42:01,949 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:42:01,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 04:42:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:09,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 4496 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 04:42:09,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:42:10,506 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-28 04:42:10,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:42:10,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294898335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:42:10,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:42:10,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2024-11-28 04:42:10,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750501309] [2024-11-28 04:42:10,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:42:10,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:42:10,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:10,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:42:10,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:42:10,511 INFO L87 Difference]: Start difference. First operand 207 states and 290 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-28 04:42:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:13,194 INFO L93 Difference]: Finished difference Result 380 states and 530 transitions. [2024-11-28 04:42:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:42:13,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 160 [2024-11-28 04:42:13,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:13,198 INFO L225 Difference]: With dead ends: 380 [2024-11-28 04:42:13,199 INFO L226 Difference]: Without dead ends: 207 [2024-11-28 04:42:13,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-28 04:42:13,201 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 280 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:13,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 782 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-28 04:42:13,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-28 04:42:13,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-28 04:42:13,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 117 states have (on average 1.170940170940171) internal successors, (137), 119 states have internal predecessors, (137), 71 states have call successors, (71), 17 states have call predecessors, (71), 18 states have return successors, (80), 70 states have call predecessors, (80), 70 states have call successors, (80) [2024-11-28 04:42:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 288 transitions. [2024-11-28 04:42:13,230 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 288 transitions. Word has length 160 [2024-11-28 04:42:13,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:13,231 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 288 transitions. [2024-11-28 04:42:13,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2024-11-28 04:42:13,232 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 288 transitions. [2024-11-28 04:42:13,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-28 04:42:13,235 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:13,236 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:42:13,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 04:42:13,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:42:13,436 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:42:13,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:13,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1577477002, now seen corresponding path program 2 times [2024-11-28 04:42:13,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:13,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130101628] [2024-11-28 04:42:13,437 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:42:13,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:19,808 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 04:42:19,808 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:42:20,947 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-11-28 04:42:20,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:20,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130101628] [2024-11-28 04:42:20,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130101628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:42:20,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:42:20,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:42:20,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685549602] [2024-11-28 04:42:20,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:42:20,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:42:20,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:20,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:42:20,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:42:20,951 INFO L87 Difference]: Start difference. First operand 207 states and 288 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-28 04:42:21,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:21,148 INFO L93 Difference]: Finished difference Result 266 states and 364 transitions. [2024-11-28 04:42:21,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:42:21,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 175 [2024-11-28 04:42:21,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:21,153 INFO L225 Difference]: With dead ends: 266 [2024-11-28 04:42:21,153 INFO L226 Difference]: Without dead ends: 212 [2024-11-28 04:42:21,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:42:21,155 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 0 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:21,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1086 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:42:21,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-28 04:42:21,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-11-28 04:42:21,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 121 states have (on average 1.165289256198347) internal successors, (141), 123 states have internal predecessors, (141), 71 states have call successors, (71), 17 states have call predecessors, (71), 19 states have return successors, (82), 71 states have call predecessors, (82), 70 states have call successors, (82) [2024-11-28 04:42:21,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 294 transitions. [2024-11-28 04:42:21,181 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 294 transitions. Word has length 175 [2024-11-28 04:42:21,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:21,182 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 294 transitions. [2024-11-28 04:42:21,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-28 04:42:21,183 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 294 transitions. [2024-11-28 04:42:21,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-28 04:42:21,186 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:21,186 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:42:21,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 04:42:21,186 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:42:21,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:21,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1443434910, now seen corresponding path program 1 times [2024-11-28 04:42:21,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:21,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778559441] [2024-11-28 04:42:21,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:21,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-28 04:42:29,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:29,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778559441] [2024-11-28 04:42:29,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778559441] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:42:29,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6822236] [2024-11-28 04:42:29,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:29,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:42:29,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:42:29,326 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:42:29,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 04:42:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:37,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 4627 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-28 04:42:37,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:42:38,609 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-28 04:42:38,609 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:42:38,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6822236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:42:38,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:42:38,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2024-11-28 04:42:38,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104357617] [2024-11-28 04:42:38,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:42:38,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:42:38,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:38,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:42:38,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:42:38,613 INFO L87 Difference]: Start difference. First operand 212 states and 294 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2024-11-28 04:42:41,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:41,527 INFO L93 Difference]: Finished difference Result 379 states and 521 transitions. [2024-11-28 04:42:41,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:42:41,528 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) Word has length 181 [2024-11-28 04:42:41,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:41,532 INFO L225 Difference]: With dead ends: 379 [2024-11-28 04:42:41,532 INFO L226 Difference]: Without dead ends: 212 [2024-11-28 04:42:41,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:42:41,534 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 308 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:41,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 945 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-28 04:42:41,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-28 04:42:41,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-11-28 04:42:41,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 121 states have (on average 1.165289256198347) internal successors, (141), 123 states have internal predecessors, (141), 71 states have call successors, (71), 17 states have call predecessors, (71), 19 states have return successors, (77), 71 states have call predecessors, (77), 70 states have call successors, (77) [2024-11-28 04:42:41,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 289 transitions. [2024-11-28 04:42:41,561 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 289 transitions. Word has length 181 [2024-11-28 04:42:41,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:41,563 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 289 transitions. [2024-11-28 04:42:41,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2024-11-28 04:42:41,564 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 289 transitions. [2024-11-28 04:42:41,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-28 04:42:41,568 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:41,569 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:42:41,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 04:42:41,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-28 04:42:41,770 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:42:41,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:41,770 INFO L85 PathProgramCache]: Analyzing trace with hash 447772293, now seen corresponding path program 1 times [2024-11-28 04:42:41,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:41,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619871177] [2024-11-28 04:42:41,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:41,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:49,787 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2024-11-28 04:42:49,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:49,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619871177] [2024-11-28 04:42:49,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619871177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:42:49,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:42:49,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:42:49,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743407747] [2024-11-28 04:42:49,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:42:49,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:42:49,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:49,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:42:49,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:42:49,789 INFO L87 Difference]: Start difference. First operand 212 states and 289 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-28 04:42:50,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:50,926 INFO L93 Difference]: Finished difference Result 376 states and 506 transitions. [2024-11-28 04:42:50,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:42:50,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 195 [2024-11-28 04:42:50,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:50,931 INFO L225 Difference]: With dead ends: 376 [2024-11-28 04:42:50,931 INFO L226 Difference]: Without dead ends: 210 [2024-11-28 04:42:50,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:42:50,933 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 46 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:50,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1092 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-28 04:42:50,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-28 04:42:50,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2024-11-28 04:42:50,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 120 states have (on average 1.1583333333333334) internal successors, (139), 121 states have internal predecessors, (139), 71 states have call successors, (71), 17 states have call predecessors, (71), 18 states have return successors, (72), 71 states have call predecessors, (72), 70 states have call successors, (72) [2024-11-28 04:42:50,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 282 transitions. [2024-11-28 04:42:50,956 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 282 transitions. Word has length 195 [2024-11-28 04:42:50,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:50,957 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 282 transitions. [2024-11-28 04:42:50,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-28 04:42:50,957 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 282 transitions. [2024-11-28 04:42:50,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-28 04:42:50,961 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:50,961 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:42:50,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 04:42:50,961 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:42:50,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:50,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1713877896, now seen corresponding path program 1 times [2024-11-28 04:42:50,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:50,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209687842] [2024-11-28 04:42:50,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:50,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:43:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2024-11-28 04:43:01,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:43:01,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209687842] [2024-11-28 04:43:01,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209687842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:43:01,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:43:01,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 04:43:01,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72758350] [2024-11-28 04:43:01,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:43:01,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:43:01,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:43:01,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:43:01,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:43:01,762 INFO L87 Difference]: Start difference. First operand 210 states and 282 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 6 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 7 states have call predecessors, (26), 6 states have call successors, (26) [2024-11-28 04:43:05,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:43:10,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:43:20,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:43:20,182 INFO L93 Difference]: Finished difference Result 337 states and 465 transitions. [2024-11-28 04:43:20,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 04:43:20,183 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 6 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 7 states have call predecessors, (26), 6 states have call successors, (26) Word has length 210 [2024-11-28 04:43:20,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:43:20,187 INFO L225 Difference]: With dead ends: 337 [2024-11-28 04:43:20,187 INFO L226 Difference]: Without dead ends: 286 [2024-11-28 04:43:20,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-28 04:43:20,189 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 349 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 75 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:43:20,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1519 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 781 Invalid, 2 Unknown, 0 Unchecked, 17.3s Time] [2024-11-28 04:43:20,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-28 04:43:20,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 236. [2024-11-28 04:43:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 134 states have (on average 1.1567164179104477) internal successors, (155), 134 states have internal predecessors, (155), 82 states have call successors, (82), 17 states have call predecessors, (82), 19 states have return successors, (86), 84 states have call predecessors, (86), 81 states have call successors, (86) [2024-11-28 04:43:20,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 323 transitions. [2024-11-28 04:43:20,220 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 323 transitions. Word has length 210 [2024-11-28 04:43:20,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:43:20,221 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 323 transitions. [2024-11-28 04:43:20,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 6 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 7 states have call predecessors, (26), 6 states have call successors, (26) [2024-11-28 04:43:20,221 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 323 transitions. [2024-11-28 04:43:20,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-28 04:43:20,225 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:43:20,225 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:43:20,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 04:43:20,226 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:43:20,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:43:20,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1947341260, now seen corresponding path program 1 times [2024-11-28 04:43:20,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:43:20,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939732135] [2024-11-28 04:43:20,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:43:20,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:43:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:43:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2024-11-28 04:43:28,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:43:28,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939732135] [2024-11-28 04:43:28,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939732135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:43:28,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:43:28,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:43:28,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414677764] [2024-11-28 04:43:28,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:43:28,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:43:28,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:43:28,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:43:28,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:43:28,310 INFO L87 Difference]: Start difference. First operand 236 states and 323 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-28 04:43:28,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:43:28,641 INFO L93 Difference]: Finished difference Result 285 states and 381 transitions. [2024-11-28 04:43:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:43:28,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) Word has length 216 [2024-11-28 04:43:28,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:43:28,646 INFO L225 Difference]: With dead ends: 285 [2024-11-28 04:43:28,647 INFO L226 Difference]: Without dead ends: 238 [2024-11-28 04:43:28,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:43:28,650 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 0 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:43:28,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1349 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 04:43:28,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-28 04:43:28,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-11-28 04:43:28,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 136 states have (on average 1.1544117647058822) internal successors, (157), 136 states have internal predecessors, (157), 82 states have call successors, (82), 17 states have call predecessors, (82), 19 states have return successors, (86), 84 states have call predecessors, (86), 81 states have call successors, (86) [2024-11-28 04:43:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 325 transitions. [2024-11-28 04:43:28,678 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 325 transitions. Word has length 216 [2024-11-28 04:43:28,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:43:28,681 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 325 transitions. [2024-11-28 04:43:28,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-28 04:43:28,681 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 325 transitions. [2024-11-28 04:43:28,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-28 04:43:28,686 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:43:28,687 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:43:28,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 04:43:28,687 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:43:28,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:43:28,688 INFO L85 PathProgramCache]: Analyzing trace with hash -561213031, now seen corresponding path program 1 times [2024-11-28 04:43:28,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:43:28,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033241581] [2024-11-28 04:43:28,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:43:28,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:43:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:43:50,208 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 21 proven. 20 refuted. 0 times theorem prover too weak. 473 trivial. 0 not checked. [2024-11-28 04:43:50,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:43:50,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033241581] [2024-11-28 04:43:50,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033241581] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:43:50,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225221324] [2024-11-28 04:43:50,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:43:50,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:43:50,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:43:50,213 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:43:50,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 04:43:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:43:59,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 5008 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-28 04:43:59,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:43:59,916 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 [2024-11-28 04:44:02,390 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_ensure_array_list_has_allocated_data_member_~list.offset_8 Int)) (and (= (store |c_old(#memory_$Pointer$#3.base)| |c_ensure_array_list_has_allocated_data_member_#in~list.base| (store (select |c_old(#memory_$Pointer$#3.base)| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_8 (select (select |c_#memory_$Pointer$#3.base| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_8))) |c_#memory_$Pointer$#3.base|) (<= v_ensure_array_list_has_allocated_data_member_~list.offset_8 |c_ensure_array_list_has_allocated_data_member_#in~list.offset|) (= |c_#memory_$Pointer$#3.offset| (store |c_old(#memory_$Pointer$#3.offset)| |c_ensure_array_list_has_allocated_data_member_#in~list.base| (store (select |c_old(#memory_$Pointer$#3.offset)| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_8 (select (select |c_#memory_$Pointer$#3.offset| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_8)))))) is different from true [2024-11-28 04:44:02,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:44:02,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-28 04:44:02,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:44:02,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-28 04:44:08,815 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (not (= .cse1 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0))))))) is different from false [2024-11-28 04:44:08,837 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (not (= .cse1 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0))))))) is different from true [2024-11-28 04:44:09,061 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)))))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0))))) is different from false [2024-11-28 04:44:09,087 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)))))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0))))) is different from true [2024-11-28 04:44:11,599 WARN L851 $PredicateComparison]: unable to prove that (and |c_aws_array_list_is_valid_#t~short139| (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)))))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))))) is different from false [2024-11-28 04:44:11,616 WARN L873 $PredicateComparison]: unable to prove that (and |c_aws_array_list_is_valid_#t~short139| (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)))))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))))) is different from true [2024-11-28 04:44:12,267 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#3.offset| .cse2)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)))))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0))))))) is different from false [2024-11-28 04:44:12,286 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#3.offset| .cse2)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)))))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0))))))) is different from true [2024-11-28 04:44:12,495 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#3.offset| .cse2)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)))))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))))) is different from false [2024-11-28 04:44:12,511 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#3.offset| .cse2)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)))))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))))) is different from true [2024-11-28 04:44:13,323 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse3 (select |c_#memory_$Pointer$#3.offset| .cse3)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (not (= .cse3 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)))))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0))))))) is different from false [2024-11-28 04:44:13,348 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse3 (select |c_#memory_$Pointer$#3.offset| .cse3)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (not (= .cse3 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)))))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0))))))) is different from true [2024-11-28 04:44:13,854 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse1) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse3 (select |c_#memory_$Pointer$#3.offset| .cse3)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (not (= .cse3 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)))))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))))) is different from false [2024-11-28 04:44:13,874 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse1) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse3 (select |c_#memory_$Pointer$#3.offset| .cse3)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (not (= .cse3 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)))))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))))) is different from true [2024-11-28 04:44:14,851 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse2) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse4 (select |c_#memory_$Pointer$#3.offset| .cse4)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (not (= .cse4 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)))))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse5 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse5) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse5) 0))))))) is different from false [2024-11-28 04:44:14,869 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse2) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse4 (select |c_#memory_$Pointer$#3.offset| .cse4)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (not (= .cse4 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)))))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse5 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse5) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse5) 0))))))) is different from true [2024-11-28 04:44:16,298 INFO L349 Elim1Store]: treesize reduction 36, result has 70.2 percent of original size [2024-11-28 04:44:16,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 139 [2024-11-28 04:44:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 293 proven. 37 refuted. 2 times theorem prover too weak. 127 trivial. 55 not checked. [2024-11-28 04:44:16,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:44:22,577 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (forall ((v_ArrVal_23638 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0#1.base| v_ArrVal_23638) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_23639 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0#1.base| v_ArrVal_23639) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0)))) is different from false [2024-11-28 04:44:22,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225221324] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:44:22,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:44:22,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 25] total 29 [2024-11-28 04:44:22,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510704071] [2024-11-28 04:44:22,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:44:22,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-28 04:44:22,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:44:22,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-28 04:44:22,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=522, Unknown=18, NotChecked=550, Total=1190 [2024-11-28 04:44:22,591 INFO L87 Difference]: Start difference. First operand 238 states and 325 transitions. Second operand has 29 states, 25 states have (on average 5.28) internal successors, (132), 24 states have internal predecessors, (132), 14 states have call successors, (54), 7 states have call predecessors, (54), 13 states have return successors, (56), 14 states have call predecessors, (56), 14 states have call successors, (56) [2024-11-28 04:44:36,086 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (let ((.cse1 (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (not (= |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0#1.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) .cse1 (or .cse1 (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (not (= .cse2 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#3.offset| .cse2)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0)))))))) is different from false [2024-11-28 04:44:36,104 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (let ((.cse1 (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (not (= |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0#1.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) .cse1 (or .cse1 (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (not (= .cse2 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#3.offset| .cse2)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0)))))))) is different from true [2024-11-28 04:44:36,125 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#3.base)| |c_#memory_$Pointer$#3.base|) (= |c_old(#memory_$Pointer$#3.offset)| |c_#memory_$Pointer$#3.offset|) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)))))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))))) is different from false [2024-11-28 04:44:36,143 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#3.base)| |c_#memory_$Pointer$#3.base|) (= |c_old(#memory_$Pointer$#3.offset)| |c_#memory_$Pointer$#3.offset|) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)))))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))))) is different from true [2024-11-28 04:44:36,217 WARN L851 $PredicateComparison]: unable to prove that (and (= c_assume_abort_if_not_~cond |c_assume_abort_if_not_#in~cond|) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#3.offset| .cse2)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)))))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))))) is different from false [2024-11-28 04:44:36,243 WARN L873 $PredicateComparison]: unable to prove that (and (= c_assume_abort_if_not_~cond |c_assume_abort_if_not_#in~cond|) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#3.offset| .cse2)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)))))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))))) is different from true [2024-11-28 04:44:36,271 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (not (= (mod |c_assume_abort_if_not_#in~cond| 256) 0)) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#3.offset| .cse2)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)))))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))))) is different from false [2024-11-28 04:44:36,290 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (not (= (mod |c_assume_abort_if_not_#in~cond| 256) 0)) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#3.offset| .cse2)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)))))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))))) is different from true [2024-11-28 04:44:36,312 WARN L851 $PredicateComparison]: unable to prove that (and (= c_assume_abort_if_not_~cond |c_assume_abort_if_not_#in~cond|) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse1) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse3 (select |c_#memory_$Pointer$#3.offset| .cse3)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (not (= .cse3 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)))))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))))) is different from false [2024-11-28 04:44:36,330 WARN L873 $PredicateComparison]: unable to prove that (and (= c_assume_abort_if_not_~cond |c_assume_abort_if_not_#in~cond|) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse1) 0)))) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse3 (select |c_#memory_$Pointer$#3.offset| .cse3)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (not (= .cse3 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)))))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))))) is different from true [2024-11-28 04:44:36,352 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse1) 0)))) (not (= (mod |c_assume_abort_if_not_#in~cond| 256) 0)) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse3 (select |c_#memory_$Pointer$#3.offset| .cse3)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (not (= .cse3 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)))))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))))) is different from false [2024-11-28 04:44:36,371 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse1) 0)))) (not (= (mod |c_assume_abort_if_not_#in~cond| 256) 0)) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#3.offset|))) (and (= (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| .cse3 (select |c_#memory_$Pointer$#3.offset| .cse3)) |c_#memory_$Pointer$#3.offset|) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_4| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (not (= .cse3 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)))))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))))) is different from true [2024-11-28 04:44:52,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:44:52,719 INFO L93 Difference]: Finished difference Result 514 states and 675 transitions. [2024-11-28 04:44:52,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-28 04:44:52,720 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 5.28) internal successors, (132), 24 states have internal predecessors, (132), 14 states have call successors, (54), 7 states have call predecessors, (54), 13 states have return successors, (56), 14 states have call predecessors, (56), 14 states have call successors, (56) Word has length 226 [2024-11-28 04:44:52,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:44:52,724 INFO L225 Difference]: With dead ends: 514 [2024-11-28 04:44:52,725 INFO L226 Difference]: Without dead ends: 301 [2024-11-28 04:44:52,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 344 SyntacticMatches, 11 SemanticMatches, 49 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=203, Invalid=1021, Unknown=30, NotChecked=1296, Total=2550 [2024-11-28 04:44:52,728 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 383 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 313 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 6792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 4240 IncrementalHoareTripleChecker+Unchecked, 26.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:44:52,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 879 Invalid, 6792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 2236 Invalid, 3 Unknown, 4240 Unchecked, 26.9s Time] [2024-11-28 04:44:52,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-28 04:44:52,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 295. [2024-11-28 04:44:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 173 states have (on average 1.1560693641618498) internal successors, (200), 174 states have internal predecessors, (200), 94 states have call successors, (94), 26 states have call predecessors, (94), 27 states have return successors, (98), 94 states have call predecessors, (98), 93 states have call successors, (98) [2024-11-28 04:44:52,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 392 transitions. [2024-11-28 04:44:52,786 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 392 transitions. Word has length 226 [2024-11-28 04:44:52,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:44:52,787 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 392 transitions. [2024-11-28 04:44:52,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 5.28) internal successors, (132), 24 states have internal predecessors, (132), 14 states have call successors, (54), 7 states have call predecessors, (54), 13 states have return successors, (56), 14 states have call predecessors, (56), 14 states have call successors, (56) [2024-11-28 04:44:52,787 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 392 transitions. [2024-11-28 04:44:52,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-28 04:44:52,792 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:44:52,792 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:44:52,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 04:44:52,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-28 04:44:52,993 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:44:52,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:44:52,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1525028899, now seen corresponding path program 1 times [2024-11-28 04:44:52,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:44:52,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211082267] [2024-11-28 04:44:52,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:52,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:45:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:45:12,236 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 21 proven. 16 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2024-11-28 04:45:12,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:45:12,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211082267] [2024-11-28 04:45:12,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211082267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:45:12,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525412897] [2024-11-28 04:45:12,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:45:12,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:45:12,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:45:12,241 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:45:12,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 04:45:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:45:21,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 5045 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-28 04:45:21,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:45:22,525 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 19 treesize of output 1 [2024-11-28 04:45:23,550 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 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-28 04:45:27,054 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-28 04:45:27,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:45:27,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525412897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:45:27,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:45:27,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 24 [2024-11-28 04:45:27,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231768702] [2024-11-28 04:45:27,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:45:27,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 04:45:27,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:45:27,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 04:45:27,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2024-11-28 04:45:27,058 INFO L87 Difference]: Start difference. First operand 295 states and 392 transitions. Second operand has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 7 states have call successors, (33), 3 states have call predecessors, (33), 6 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2024-11-28 04:45:31,132 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] [2024-11-28 04:45:35,773 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] [2024-11-28 04:45:45,674 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] [2024-11-28 04:45:51,846 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] [2024-11-28 04:45:55,981 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] [2024-11-28 04:46:00,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 04:46:04,814 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] [2024-11-28 04:46:08,923 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] [2024-11-28 04:46:13,572 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] [2024-11-28 04:46:21,305 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] [2024-11-28 04:46:22,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:46:22,988 INFO L93 Difference]: Finished difference Result 613 states and 807 transitions. [2024-11-28 04:46:22,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 04:46:22,989 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 7 states have call successors, (33), 3 states have call predecessors, (33), 6 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) Word has length 232 [2024-11-28 04:46:22,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:46:22,994 INFO L225 Difference]: With dead ends: 613 [2024-11-28 04:46:22,994 INFO L226 Difference]: Without dead ends: 435 [2024-11-28 04:46:22,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2024-11-28 04:46:22,997 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 161 mSDsluCounter, 2461 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 36 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 2872 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:46:22,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 2872 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1170 Invalid, 10 Unknown, 0 Unchecked, 54.2s Time] [2024-11-28 04:46:22,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-28 04:46:23,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 427. [2024-11-28 04:46:23,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 252 states have (on average 1.1547619047619047) internal successors, (291), 258 states have internal predecessors, (291), 130 states have call successors, (130), 41 states have call predecessors, (130), 44 states have return successors, (142), 127 states have call predecessors, (142), 128 states have call successors, (142) [2024-11-28 04:46:23,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 563 transitions. [2024-11-28 04:46:23,067 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 563 transitions. Word has length 232 [2024-11-28 04:46:23,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:46:23,070 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 563 transitions. [2024-11-28 04:46:23,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 7 states have call successors, (33), 3 states have call predecessors, (33), 6 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2024-11-28 04:46:23,071 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 563 transitions. [2024-11-28 04:46:23,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-28 04:46:23,074 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:46:23,074 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:46:23,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 04:46:23,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:46:23,275 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:46:23,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:46:23,275 INFO L85 PathProgramCache]: Analyzing trace with hash -293180649, now seen corresponding path program 1 times [2024-11-28 04:46:23,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:46:23,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525135972] [2024-11-28 04:46:23,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:46:23,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:46:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:46:40,151 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 21 proven. 16 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2024-11-28 04:46:40,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:46:40,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525135972] [2024-11-28 04:46:40,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525135972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:46:40,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404012423] [2024-11-28 04:46:40,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:46:40,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:46:40,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:46:40,155 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:46:40,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 04:46:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:46:48,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 5050 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-28 04:46:48,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:46:48,864 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 [2024-11-28 04:46:50,892 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_ensure_array_list_has_allocated_data_member_~list.offset_13 Int)) (and (<= v_ensure_array_list_has_allocated_data_member_~list.offset_13 |c_ensure_array_list_has_allocated_data_member_#in~list.offset|) (= (store |c_old(#memory_$Pointer$#3.base)| |c_ensure_array_list_has_allocated_data_member_#in~list.base| (store (select |c_old(#memory_$Pointer$#3.base)| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_13 (select (select |c_#memory_$Pointer$#3.base| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_13))) |c_#memory_$Pointer$#3.base|) (= (store |c_old(#memory_$Pointer$#3.offset)| |c_ensure_array_list_has_allocated_data_member_#in~list.base| (store (select |c_old(#memory_$Pointer$#3.offset)| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_13 (select (select |c_#memory_$Pointer$#3.offset| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_13))) |c_#memory_$Pointer$#3.offset|))) is different from true [2024-11-28 04:46:51,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:46:51,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-28 04:46:51,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:46:51,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-28 04:46:56,358 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 [2024-11-28 04:46:56,382 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 [2024-11-28 04:46:57,063 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (or (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (not (= .cse1 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0))))) (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0))) is different from false [2024-11-28 04:46:57,080 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (or (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (not (= .cse1 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0))))) (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0))) is different from true [2024-11-28 04:46:57,248 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0))))) is different from false [2024-11-28 04:46:57,264 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0))))) is different from true [2024-11-28 04:46:59,717 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0))))) |c_aws_array_list_is_valid_#t~short138|) is different from false [2024-11-28 04:46:59,732 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0))))) |c_aws_array_list_is_valid_#t~short138|) is different from true [2024-11-28 04:46:59,893 WARN L851 $PredicateComparison]: unable to prove that (and |c_aws_array_list_is_valid_#t~short139| (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0)))))) is different from false [2024-11-28 04:46:59,908 WARN L873 $PredicateComparison]: unable to prove that (and |c_aws_array_list_is_valid_#t~short139| (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0)))))) is different from true [2024-11-28 04:47:00,347 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse1) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse2 (select |c_#memory_$Pointer$#3.offset| .cse2))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse3) 0) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse3) 0))))))) is different from false [2024-11-28 04:47:00,363 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse1) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse2 (select |c_#memory_$Pointer$#3.offset| .cse2))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse3) 0) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse3) 0))))))) is different from true [2024-11-28 04:47:00,537 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse3) 0))))) is different from false [2024-11-28 04:47:00,553 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse3) 0))))) is different from true [2024-11-28 04:47:01,286 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse1) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse2 (select |c_#memory_$Pointer$#3.offset| .cse2))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse3) 0) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse3) 0))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse4) 0)))))) is different from false [2024-11-28 04:47:01,302 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse1) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse2 (select |c_#memory_$Pointer$#3.offset| .cse2))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse3) 0) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse3) 0))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse4) 0)))))) is different from true [2024-11-28 04:47:01,724 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_25| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_25|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41|) .cse3) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse4) 0))))) is different from false [2024-11-28 04:47:01,740 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_25| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_25|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41|) .cse3) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse4) 0))))) is different from true [2024-11-28 04:47:02,737 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse1) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse2 (select |c_#memory_$Pointer$#3.offset| .cse2))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse3) 0) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse3) 0))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_25| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_25|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41|) .cse4) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24| Int)) (let ((.cse5 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse5) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse5) 0)))))) is different from false [2024-11-28 04:47:02,755 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse1) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse2 (select |c_#memory_$Pointer$#3.offset| .cse2))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse3) 0) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse3) 0))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_25| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_25|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41|) .cse4) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24| Int)) (let ((.cse5 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse5) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse5) 0)))))) is different from true [2024-11-28 04:47:04,157 INFO L349 Elim1Store]: treesize reduction 36, result has 70.2 percent of original size [2024-11-28 04:47:04,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 139 [2024-11-28 04:47:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 293 proven. 33 refuted. 2 times theorem prover too weak. 124 trivial. 55 not checked. [2024-11-28 04:47:04,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:47:10,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404012423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:47:10,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:47:10,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 27] total 31 [2024-11-28 04:47:10,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135729462] [2024-11-28 04:47:10,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:47:10,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-28 04:47:10,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:47:10,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-28 04:47:10,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=597, Unknown=35, NotChecked=590, Total=1332 [2024-11-28 04:47:10,459 INFO L87 Difference]: Start difference. First operand 427 states and 563 transitions. Second operand has 31 states, 27 states have (on average 5.296296296296297) internal successors, (143), 26 states have internal predecessors, (143), 15 states have call successors, (55), 7 states have call predecessors, (55), 13 states have return successors, (57), 15 states have call predecessors, (57), 15 states have call successors, (57) [2024-11-28 04:47:22,348 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse2) 0))) (and (or .cse0 (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (not (= .cse1 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse2) 0))))) (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse2) 0) (not (= |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0#1.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) .cse0))) is different from false [2024-11-28 04:47:22,364 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse2) 0))) (and (or .cse0 (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (not (= .cse1 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse2) 0))))) (= (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse2) 0) (not (= |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0#1.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) .cse0))) is different from true [2024-11-28 04:47:22,383 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#3.base)| |c_#memory_$Pointer$#3.base|) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0))))) (= |c_old(#memory_$Pointer$#3.offset)| |c_#memory_$Pointer$#3.offset|)) is different from false [2024-11-28 04:47:22,401 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#3.base)| |c_#memory_$Pointer$#3.base|) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0))))) (= |c_old(#memory_$Pointer$#3.offset)| |c_#memory_$Pointer$#3.offset|)) is different from true [2024-11-28 04:47:22,441 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#3.base)| |c_#memory_$Pointer$#3.base|) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0))))) (= |c_old(#memory_$Pointer$#3.offset)| |c_#memory_$Pointer$#3.offset|) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse3) 0))))) is different from false [2024-11-28 04:47:22,458 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#3.base)| |c_#memory_$Pointer$#3.base|) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0))))) (= |c_old(#memory_$Pointer$#3.offset)| |c_#memory_$Pointer$#3.offset|) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse3) 0))))) is different from true [2024-11-28 04:47:22,478 WARN L851 $PredicateComparison]: unable to prove that (and (= c_assume_abort_if_not_~cond |c_assume_abort_if_not_#in~cond|) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse3) 0))))) is different from false [2024-11-28 04:47:22,495 WARN L873 $PredicateComparison]: unable to prove that (and (= c_assume_abort_if_not_~cond |c_assume_abort_if_not_#in~cond|) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse3) 0))))) is different from true [2024-11-28 04:47:22,516 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse3) 0)))) (not (= (mod |c_assume_abort_if_not_#in~cond| 256) 0))) is different from false [2024-11-28 04:47:22,532 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse3) 0)))) (not (= (mod |c_assume_abort_if_not_#in~cond| 256) 0))) is different from true [2024-11-28 04:47:22,553 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#3.base)| |c_#memory_$Pointer$#3.base|) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_25| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_25|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41|) .cse3) 0)))) (= |c_old(#memory_$Pointer$#3.offset)| |c_#memory_$Pointer$#3.offset|) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse4) 0))))) is different from false [2024-11-28 04:47:22,570 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#3.base)| |c_#memory_$Pointer$#3.base|) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_25| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_25|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41|) .cse3) 0)))) (= |c_old(#memory_$Pointer$#3.offset)| |c_#memory_$Pointer$#3.offset|) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse4) 0))))) is different from true [2024-11-28 04:47:22,590 WARN L851 $PredicateComparison]: unable to prove that (and (= c_assume_abort_if_not_~cond |c_assume_abort_if_not_#in~cond|) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_25| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_25|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41|) .cse3) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse4) 0))))) is different from false [2024-11-28 04:47:22,606 WARN L873 $PredicateComparison]: unable to prove that (and (= c_assume_abort_if_not_~cond |c_assume_abort_if_not_#in~cond|) (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_25| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_25|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41|) .cse3) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse4) 0))))) is different from true [2024-11-28 04:47:22,626 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_25| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_25|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41|) .cse3) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse4) 0)))) (not (= (mod |c_assume_abort_if_not_#in~cond| 256) 0))) is different from false [2024-11-28 04:47:22,643 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23| Int)) (let ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_23|))) (and (exists ((|v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |c_#memory_$Pointer$#3.offset|))) (and (= |c_#memory_$Pointer$#3.offset| (store |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| .cse1 (select |c_#memory_$Pointer$#3.offset| .cse1))) (= (select (select |v_#memory_$Pointer$#3.offset_BEFORE_CALL_8| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|))))) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_39|) .cse2) 0))))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_25| Int)) (let ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_25|))) (and (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_41|) .cse3) 0)))) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24| Int)) (let ((.cse4 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_24|))) (and (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse4) 0) (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_40|) .cse4) 0)))) (not (= (mod |c_assume_abort_if_not_#in~cond| 256) 0))) is different from true [2024-11-28 04:47:33,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:47:33,094 INFO L93 Difference]: Finished difference Result 696 states and 909 transitions. [2024-11-28 04:47:33,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-28 04:47:33,095 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 5.296296296296297) internal successors, (143), 26 states have internal predecessors, (143), 15 states have call successors, (55), 7 states have call predecessors, (55), 13 states have return successors, (57), 15 states have call predecessors, (57), 15 states have call successors, (57) Word has length 234 [2024-11-28 04:47:33,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:47:33,098 INFO L225 Difference]: With dead ends: 696 [2024-11-28 04:47:33,099 INFO L226 Difference]: Without dead ends: 388 [2024-11-28 04:47:33,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 353 SyntacticMatches, 11 SemanticMatches, 53 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=218, Invalid=1134, Unknown=52, NotChecked=1566, Total=2970 [2024-11-28 04:47:33,102 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 382 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 1836 mSolverCounterSat, 309 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 6893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 1836 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 4745 IncrementalHoareTripleChecker+Unchecked, 19.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:47:33,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 651 Invalid, 6893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 1836 Invalid, 3 Unknown, 4745 Unchecked, 19.4s Time] [2024-11-28 04:47:33,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-28 04:47:33,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 386. [2024-11-28 04:47:33,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 226 states have (on average 1.1504424778761062) internal successors, (260), 231 states have internal predecessors, (260), 120 states have call successors, (120), 36 states have call predecessors, (120), 39 states have return successors, (131), 118 states have call predecessors, (131), 118 states have call successors, (131) [2024-11-28 04:47:33,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 511 transitions. [2024-11-28 04:47:33,162 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 511 transitions. Word has length 234 [2024-11-28 04:47:33,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:47:33,163 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 511 transitions. [2024-11-28 04:47:33,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 5.296296296296297) internal successors, (143), 26 states have internal predecessors, (143), 15 states have call successors, (55), 7 states have call predecessors, (55), 13 states have return successors, (57), 15 states have call predecessors, (57), 15 states have call successors, (57) [2024-11-28 04:47:33,163 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 511 transitions. [2024-11-28 04:47:33,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-28 04:47:33,166 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:47:33,166 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:47:33,199 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 04:47:33,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-28 04:47:33,367 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:47:33,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:47:33,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1632454995, now seen corresponding path program 1 times [2024-11-28 04:47:33,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:47:33,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053952373] [2024-11-28 04:47:33,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:47:33,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:47:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:47:52,305 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2024-11-28 04:47:52,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:47:52,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053952373] [2024-11-28 04:47:52,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053952373] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:47:52,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223826158] [2024-11-28 04:47:52,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:47:52,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:47:52,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:47:52,307 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:47:52,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 04:48:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:48:01,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 5087 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-28 04:48:01,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:48:02,356 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 19 treesize of output 1 [2024-11-28 04:48:03,555 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 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-28 04:48:06,485 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-11-28 04:48:06,485 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:48:06,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223826158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:48:06,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:48:06,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2024-11-28 04:48:06,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863902656] [2024-11-28 04:48:06,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:48:06,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 04:48:06,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:48:06,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 04:48:06,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2024-11-28 04:48:06,488 INFO L87 Difference]: Start difference. First operand 386 states and 511 transitions. Second operand has 13 states, 12 states have (on average 7.25) internal successors, (87), 11 states have internal predecessors, (87), 7 states have call successors, (32), 3 states have call predecessors, (32), 6 states have return successors, (31), 7 states have call predecessors, (31), 7 states have call successors, (31) [2024-11-28 04:48:10,506 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] [2024-11-28 04:48:19,163 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] [2024-11-28 04:48:24,631 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] [2024-11-28 04:48:28,717 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] [2024-11-28 04:48:32,801 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] [2024-11-28 04:48:37,086 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] [2024-11-28 04:48:41,174 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] [2024-11-28 04:48:45,870 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] [2024-11-28 04:48:52,947 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] [2024-11-28 04:48:54,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:48:54,456 INFO L93 Difference]: Finished difference Result 756 states and 1000 transitions. [2024-11-28 04:48:54,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 04:48:54,457 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.25) internal successors, (87), 11 states have internal predecessors, (87), 7 states have call successors, (32), 3 states have call predecessors, (32), 6 states have return successors, (31), 7 states have call predecessors, (31), 7 states have call successors, (31) Word has length 240 [2024-11-28 04:48:54,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:48:54,461 INFO L225 Difference]: With dead ends: 756 [2024-11-28 04:48:54,461 INFO L226 Difference]: Without dead ends: 393 [2024-11-28 04:48:54,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=133, Invalid=859, Unknown=0, NotChecked=0, Total=992 [2024-11-28 04:48:54,464 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 216 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 15 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 2170 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:48:54,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 2170 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1027 Invalid, 9 Unknown, 0 Unchecked, 46.6s Time] [2024-11-28 04:48:54,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-28 04:48:54,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 386. [2024-11-28 04:48:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 226 states have (on average 1.1504424778761062) internal successors, (260), 231 states have internal predecessors, (260), 120 states have call successors, (120), 36 states have call predecessors, (120), 39 states have return successors, (130), 118 states have call predecessors, (130), 118 states have call successors, (130) [2024-11-28 04:48:54,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 510 transitions. [2024-11-28 04:48:54,519 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 510 transitions. Word has length 240 [2024-11-28 04:48:54,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:48:54,520 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 510 transitions. [2024-11-28 04:48:54,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.25) internal successors, (87), 11 states have internal predecessors, (87), 7 states have call successors, (32), 3 states have call predecessors, (32), 6 states have return successors, (31), 7 states have call predecessors, (31), 7 states have call successors, (31) [2024-11-28 04:48:54,520 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 510 transitions. [2024-11-28 04:48:54,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-28 04:48:54,522 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:48:54,522 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:48:54,556 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 04:48:54,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:48:54,723 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:48:54,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:48:54,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1288362585, now seen corresponding path program 2 times [2024-11-28 04:48:54,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:48:54,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290475655] [2024-11-28 04:48:54,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:48:54,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:07,000 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:49:07,000 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:49:17,475 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 37 proven. 11 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2024-11-28 04:49:17,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:17,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290475655] [2024-11-28 04:49:17,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290475655] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:49:17,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330476514] [2024-11-28 04:49:17,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:49:17,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:49:17,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:49:17,477 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:49:17,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c20b0ecd-9aaa-4b49-92f0-69cecb4ce28f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process