./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX --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 d7c0f5b67426dc3769ace794e9c8c036d37ffa3960449e6b59343c653ea0c545 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:11:16,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:11:16,571 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-08 19:11:16,576 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:11:16,576 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:11:16,606 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:11:16,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:11:16,607 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:11:16,607 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:11:16,608 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:11:16,608 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:11:16,608 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:11:16,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:11:16,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:11:16,610 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:11:16,613 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:11:16,615 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:11:16,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:11:16,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:11:16,616 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:11:16,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:11:16,620 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:11:16,621 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:11:16,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:11:16,621 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:11:16,621 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:11:16,622 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:11:16,622 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:11:16,622 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:11:16,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:11:16,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:11:16,623 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:11:16,623 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:11:16,624 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:11:16,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:11:16,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:11:16,628 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:11:16,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:11:16,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:11:16,629 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX 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 -> d7c0f5b67426dc3769ace794e9c8c036d37ffa3960449e6b59343c653ea0c545 [2024-11-08 19:11:16,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:11:16,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:11:16,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:11:16,954 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:11:16,954 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:11:16,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i Unable to find full path for "g++" [2024-11-08 19:11:18,960 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:11:19,497 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:11:19,498 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i [2024-11-08 19:11:19,545 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/data/e2df19c77/466208029b8a4f1fa4574d6fd7117659/FLAGa224211ae [2024-11-08 19:11:20,035 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/data/e2df19c77/466208029b8a4f1fa4574d6fd7117659 [2024-11-08 19:11:20,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:11:20,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:11:20,041 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:11:20,041 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:11:20,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:11:20,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:11:20" (1/1) ... [2024-11-08 19:11:20,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a25ec2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:20, skipping insertion in model container [2024-11-08 19:11:20,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:11:20" (1/1) ... [2024-11-08 19:11:20,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:11:20,597 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_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i[4493,4506] [2024-11-08 19:11:20,605 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_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i[4553,4566] [2024-11-08 19:11:21,582 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:21,583 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:21,584 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:21,585 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:21,586 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:21,602 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:21,603 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:21,605 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:21,606 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:21,608 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:21,610 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:21,611 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:21,611 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:22,245 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:22,245 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:22,251 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:22,261 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:22,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:11:22,359 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:11:22,375 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_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i[4493,4506] [2024-11-08 19:11:22,376 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_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i[4553,4566] [2024-11-08 19:11:22,483 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:22,484 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:22,484 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:22,485 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:22,486 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:22,494 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:22,495 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:22,496 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:22,497 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:22,498 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:22,499 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:22,500 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:22,500 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:22,734 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:22,735 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:22,737 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:22,745 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-08 19:11:22,754 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7775-7786] [2024-11-08 19:11:22,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:11:23,085 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:11:23,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:23 WrapperNode [2024-11-08 19:11:23,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:11:23,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:11:23,092 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:11:23,092 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:11:23,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:23" (1/1) ... [2024-11-08 19:11:23,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:23" (1/1) ... [2024-11-08 19:11:23,318 INFO L138 Inliner]: procedures = 680, calls = 1678, calls flagged for inlining = 52, calls inlined = 7, statements flattened = 718 [2024-11-08 19:11:23,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:11:23,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:11:23,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:11:23,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:11:23,344 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:23" (1/1) ... [2024-11-08 19:11:23,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:23" (1/1) ... [2024-11-08 19:11:23,359 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:23" (1/1) ... [2024-11-08 19:11:23,436 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-08 19:11:23,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:23" (1/1) ... [2024-11-08 19:11:23,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:23" (1/1) ... [2024-11-08 19:11:23,483 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:23" (1/1) ... [2024-11-08 19:11:23,489 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:23" (1/1) ... [2024-11-08 19:11:23,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:23" (1/1) ... [2024-11-08 19:11:23,514 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:23" (1/1) ... [2024-11-08 19:11:23,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:11:23,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:11:23,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:11:23,538 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:11:23,539 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:23" (1/1) ... [2024-11-08 19:11:23,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:11:23,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:11:23,579 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:11:23,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:11:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 19:11:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2024-11-08 19:11:23,617 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2024-11-08 19:11:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2024-11-08 19:11:23,617 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2024-11-08 19:11:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2024-11-08 19:11:23,617 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2024-11-08 19:11:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2024-11-08 19:11:23,617 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2024-11-08 19:11:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-08 19:11:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-08 19:11:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-08 19:11:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-08 19:11:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-08 19:11:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 19:11:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 19:11:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 19:11:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 19:11:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-08 19:11:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2024-11-08 19:11:23,620 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2024-11-08 19:11:23,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 19:11:23,620 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 19:11:23,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 19:11:23,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:11:23,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 19:11:23,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 19:11:23,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 19:11:23,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-08 19:11:23,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-08 19:11:23,622 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_impl [2024-11-08 19:11:23,623 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_impl [2024-11-08 19:11:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:11:23,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:11:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2024-11-08 19:11:23,623 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2024-11-08 19:11:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2024-11-08 19:11:23,623 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2024-11-08 19:11:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-08 19:11:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-08 19:11:23,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-11-08 19:11:23,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-11-08 19:11:23,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-11-08 19:11:23,626 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2024-11-08 19:11:23,626 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2024-11-08 19:11:23,626 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2024-11-08 19:11:23,626 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2024-11-08 19:11:23,626 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:11:23,627 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:11:23,627 INFO L130 BoogieDeclarations]: Found specification of procedure my_memcpy [2024-11-08 19:11:23,627 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memcpy [2024-11-08 19:11:23,627 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2024-11-08 19:11:23,627 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2024-11-08 19:11:23,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 19:11:23,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 19:11:23,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 19:11:23,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 19:11:23,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-08 19:11:23,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-08 19:11:23,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 19:11:23,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 19:11:23,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 19:11:23,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-08 19:11:23,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-08 19:11:23,628 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2024-11-08 19:11:23,628 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2024-11-08 19:11:23,628 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2024-11-08 19:11:23,628 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2024-11-08 19:11:23,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 19:11:23,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 19:11:23,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 19:11:23,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 19:11:23,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-08 19:11:23,629 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2024-11-08 19:11:23,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2024-11-08 19:11:23,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:11:23,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 19:11:23,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 19:11:23,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 19:11:23,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 19:11:24,008 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:11:24,011 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:11:30,725 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-08 19:11:30,726 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:11:30,751 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:11:30,753 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 19:11:30,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:11:30 BoogieIcfgContainer [2024-11-08 19:11:30,754 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:11:30,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:11:30,759 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:11:30,762 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:11:30,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:11:20" (1/3) ... [2024-11-08 19:11:30,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e49cb2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:11:30, skipping insertion in model container [2024-11-08 19:11:30,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:23" (2/3) ... [2024-11-08 19:11:30,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e49cb2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:11:30, skipping insertion in model container [2024-11-08 19:11:30,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:11:30" (3/3) ... [2024-11-08 19:11:30,768 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_array_list_copy_harness.i [2024-11-08 19:11:30,788 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:11:30,788 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:11:30,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:11:30,896 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;@4d6946f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:11:30,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:11:30,901 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-08 19:11:30,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 19:11:30,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:11:30,918 INFO L215 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-08 19:11:30,919 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:11:30,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:11:30,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1329126664, now seen corresponding path program 1 times [2024-11-08 19:11:30,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:11:30,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290603168] [2024-11-08 19:11:30,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:11:30,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:11:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:38,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:11:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:38,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:11:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:39,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 19:11:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:39,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:11:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:39,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 19:11:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:39,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 19:11:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:39,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 19:11:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:39,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 19:11:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:39,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:11:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:39,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 19:11:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:39,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:11:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:39,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 19:11:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:39,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:11:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:39,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 19:11:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:39,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:11:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:39,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:11:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:39,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 19:11:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:39,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 19:11:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:39,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 19:11:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:39,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 19:11:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:39,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 19:11:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:39,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 19:11:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:39,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 19:11:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:39,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:11:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:39,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 19:11:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:39,857 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2024-11-08 19:11:39,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:11:39,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290603168] [2024-11-08 19:11:39,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290603168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:11:39,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:11:39,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:11:39,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845590222] [2024-11-08 19:11:39,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:11:39,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:11:39,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:11:39,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:11:39,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:11:39,914 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 5 states, 5 states have (on average 7.8) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (24), 5 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-08 19:11:44,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 19:11:48,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 19:11:52,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 19:11:59,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:11:59,634 INFO L93 Difference]: Finished difference Result 442 states and 648 transitions. [2024-11-08 19:11:59,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:11:59,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (24), 5 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-08 19:11:59,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:11:59,655 INFO L225 Difference]: With dead ends: 442 [2024-11-08 19:11:59,655 INFO L226 Difference]: Without dead ends: 232 [2024-11-08 19:11:59,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:11:59,670 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 215 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 272 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:11:59,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 239 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 336 Invalid, 3 Unknown, 0 Unchecked, 19.0s Time] [2024-11-08 19:11:59,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-08 19:11:59,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 204. [2024-11-08 19:11:59,762 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-08 19:11:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 276 transitions. [2024-11-08 19:11:59,769 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 276 transitions. Word has length 145 [2024-11-08 19:11:59,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:11:59,770 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 276 transitions. [2024-11-08 19:11:59,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (24), 5 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-08 19:11:59,771 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 276 transitions. [2024-11-08 19:11:59,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 19:11:59,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:11:59,779 INFO L215 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-08 19:11:59,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:11:59,780 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:11:59,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:11:59,781 INFO L85 PathProgramCache]: Analyzing trace with hash -433130932, now seen corresponding path program 1 times [2024-11-08 19:11:59,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:11:59,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267964736] [2024-11-08 19:11:59,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:11:59,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:12:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:07,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:12:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:07,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:12:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:08,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 19:12:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:08,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:12:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:08,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 19:12:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:08,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 19:12:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:08,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 19:12:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:08,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 19:12:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:08,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:12:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:08,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 19:12:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:08,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:12:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:08,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 19:12:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:08,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:12:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:08,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 19:12:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:08,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:12:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:08,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:12:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:08,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 19:12:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:08,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 19:12:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:08,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 19:12:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:08,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 19:12:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:08,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 19:12:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:08,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 19:12:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:08,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 19:12:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:09,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:12:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:09,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 19:12:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:09,044 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-08 19:12:09,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:12:09,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267964736] [2024-11-08 19:12:09,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267964736] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:12:09,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032668022] [2024-11-08 19:12:09,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:12:09,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:09,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:12:09,047 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:12:09,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 19:12:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:16,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 4363 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 19:12:16,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:12:16,107 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-08 19:12:16,107 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:12:16,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032668022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:12:16,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 19:12:16,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-08 19:12:16,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037932732] [2024-11-08 19:12:16,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:12:16,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:12:16,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:12:16,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:12:16,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:12:16,118 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-08 19:12:16,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:12:16,217 INFO L93 Difference]: Finished difference Result 403 states and 547 transitions. [2024-11-08 19:12:16,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:12:16,218 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-08 19:12:16,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:12:16,221 INFO L225 Difference]: With dead ends: 403 [2024-11-08 19:12:16,222 INFO L226 Difference]: Without dead ends: 205 [2024-11-08 19:12:16,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:12:16,225 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 0 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:12:16,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 546 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:12:16,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-08 19:12:16,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-08 19:12:16,256 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-08 19:12:16,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 277 transitions. [2024-11-08 19:12:16,259 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 277 transitions. Word has length 145 [2024-11-08 19:12:16,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:12:16,260 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 277 transitions. [2024-11-08 19:12:16,260 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-08 19:12:16,261 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 277 transitions. [2024-11-08 19:12:16,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 19:12:16,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:12:16,264 INFO L215 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-08 19:12:16,298 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 19:12:16,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:16,465 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:12:16,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:12:16,465 INFO L85 PathProgramCache]: Analyzing trace with hash 995250632, now seen corresponding path program 1 times [2024-11-08 19:12:16,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:12:16,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139408668] [2024-11-08 19:12:16,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:12:16,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:12:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:23,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:12:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:23,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:12:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:24,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 19:12:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:24,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:12:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:24,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 19:12:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:24,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 19:12:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:24,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 19:12:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:24,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 19:12:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:24,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:12:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:24,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 19:12:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:24,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:12:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:24,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 19:12:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:24,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:12:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:24,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 19:12:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:24,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:12:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:24,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:12:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:24,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 19:12:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:24,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 19:12:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:24,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 19:12:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:24,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 19:12:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:25,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 19:12:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:25,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 19:12:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:25,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 19:12:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:25,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:12:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:25,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 19:12:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:25,368 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-08 19:12:25,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:12:25,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139408668] [2024-11-08 19:12:25,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139408668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:12:25,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884672188] [2024-11-08 19:12:25,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:12:25,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:25,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:12:25,375 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:12:25,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 19:12:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:32,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 4369 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 19:12:32,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:12:33,556 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-08 19:12:33,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:12:33,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884672188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:12:33,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 19:12:33,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-11-08 19:12:33,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857606157] [2024-11-08 19:12:33,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:12:33,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:12:33,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:12:33,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:12:33,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:12:33,561 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-08 19:12:36,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:12:36,913 INFO L93 Difference]: Finished difference Result 405 states and 558 transitions. [2024-11-08 19:12:36,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:12:36,914 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-08 19:12:36,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:12:36,917 INFO L225 Difference]: With dead ends: 405 [2024-11-08 19:12:36,917 INFO L226 Difference]: Without dead ends: 207 [2024-11-08 19:12:36,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-08 19:12:36,920 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 282 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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.9s IncrementalHoareTripleChecker+Time [2024-11-08 19:12:36,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 779 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 19:12:36,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-08 19:12:36,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-08 19:12:36,952 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-08 19:12:36,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 290 transitions. [2024-11-08 19:12:36,955 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 290 transitions. Word has length 145 [2024-11-08 19:12:36,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:12:36,956 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 290 transitions. [2024-11-08 19:12:36,956 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-08 19:12:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 290 transitions. [2024-11-08 19:12:36,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 19:12:36,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:12:36,959 INFO L215 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-08 19:12:36,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 19:12:37,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:37,160 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:12:37,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:12:37,161 INFO L85 PathProgramCache]: Analyzing trace with hash -139108393, now seen corresponding path program 1 times [2024-11-08 19:12:37,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:12:37,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578567062] [2024-11-08 19:12:37,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:12:37,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:12:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:43,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:12:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:43,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:12:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:43,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 19:12:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:43,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:12:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:43,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 19:12:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:44,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 19:12:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:44,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:12:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:44,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:12:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:44,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:12:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:44,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:12:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:44,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:12:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:44,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:12:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:44,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:12:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:44,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 19:12:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:44,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:12:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:44,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:12:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:44,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:12:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:44,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 19:12:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:44,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 19:12:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:44,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:12:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:44,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:12:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:44,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:12:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:44,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:12:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:44,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:12:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:44,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 19:12:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:44,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:12:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:44,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-08 19:12:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:44,870 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-08 19:12:44,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:12:44,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578567062] [2024-11-08 19:12:44,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578567062] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:12:44,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793325070] [2024-11-08 19:12:44,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:12:44,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:44,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:12:44,873 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:12:44,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 19:12:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:54,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 4496 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 19:12:54,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:12:55,981 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-08 19:12:55,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:12:55,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793325070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:12:55,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 19:12:55,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-11-08 19:12:55,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387602016] [2024-11-08 19:12:55,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:12:55,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:12:55,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:12:55,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:12:55,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:12:55,987 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-08 19:13:00,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:00,679 INFO L93 Difference]: Finished difference Result 380 states and 530 transitions. [2024-11-08 19:13:00,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:13:00,680 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-08 19:13:00,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:00,684 INFO L225 Difference]: With dead ends: 380 [2024-11-08 19:13:00,685 INFO L226 Difference]: Without dead ends: 207 [2024-11-08 19:13:00,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-08 19:13:00,687 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 280 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s 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, 4.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:00,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 782 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-08 19:13:00,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-08 19:13:00,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-08 19:13:00,726 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-08 19:13:00,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 288 transitions. [2024-11-08 19:13:00,731 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 288 transitions. Word has length 160 [2024-11-08 19:13:00,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:00,734 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 288 transitions. [2024-11-08 19:13:00,734 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-08 19:13:00,735 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 288 transitions. [2024-11-08 19:13:00,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 19:13:00,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:00,739 INFO L215 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-08 19:13:00,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 19:13:00,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 19:13:00,940 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:00,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:00,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1577477002, now seen corresponding path program 2 times [2024-11-08 19:13:00,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:00,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601683013] [2024-11-08 19:13:00,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:00,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:10,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:13:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:11,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:13:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:11,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 19:13:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:11,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:13:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:11,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 19:13:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:11,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 19:13:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:12,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:13:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:12,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:13:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:12,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:13:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:12,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:13:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:12,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:13:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:12,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:13:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:12,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:13:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:12,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 19:13:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:12,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:13:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:12,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:13:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:12,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:13:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:12,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 19:13:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:12,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 19:13:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:12,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 19:13:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:12,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:13:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:12,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:13:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:12,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 19:13:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:13,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 19:13:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:13,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 19:13:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:13,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 19:13:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:13,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 19:13:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:13,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:13:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:13,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 19:13:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:13,202 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-08 19:13:13,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:13,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601683013] [2024-11-08 19:13:13,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601683013] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:13:13,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887964398] [2024-11-08 19:13:13,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 19:13:13,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:13:13,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:13:13,206 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:13:13,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 19:13:21,800 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-08 19:13:21,800 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:13:21,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 3932 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 19:13:21,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:13:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-11-08 19:13:22,602 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:13:22,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887964398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:22,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 19:13:22,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-08 19:13:22,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221141839] [2024-11-08 19:13:22,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:22,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:13:22,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:22,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:13:22,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:13:22,611 INFO L87 Difference]: Start difference. First operand 207 states and 288 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 19:13:22,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:22,881 INFO L93 Difference]: Finished difference Result 266 states and 364 transitions. [2024-11-08 19:13:22,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:13:22,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 175 [2024-11-08 19:13:22,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:22,886 INFO L225 Difference]: With dead ends: 266 [2024-11-08 19:13:22,887 INFO L226 Difference]: Without dead ends: 212 [2024-11-08 19:13:22,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:13:22,889 INFO L432 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-08 19:13:22,889 INFO L433 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-08 19:13:22,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-08 19:13:22,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-11-08 19:13:22,921 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-08 19:13:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 294 transitions. [2024-11-08 19:13:22,924 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 294 transitions. Word has length 175 [2024-11-08 19:13:22,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:22,925 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 294 transitions. [2024-11-08 19:13:22,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 19:13:22,925 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 294 transitions. [2024-11-08 19:13:22,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-08 19:13:22,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:22,928 INFO L215 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-08 19:13:22,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 19:13:23,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:13:23,129 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:23,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:23,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1443434910, now seen corresponding path program 1 times [2024-11-08 19:13:23,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:23,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915988491] [2024-11-08 19:13:23,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:23,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:30,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:13:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:30,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:13:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:30,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 19:13:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:30,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:13:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:30,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 19:13:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 19:13:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:13:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:13:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:13:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:13:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:13:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:13:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:13:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 19:13:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:13:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:13:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:13:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 19:13:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 19:13:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 19:13:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:13:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:13:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 19:13:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:32,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 19:13:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:32,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 19:13:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:32,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 19:13:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:32,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 19:13:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:32,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:13:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:32,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:13:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:32,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 19:13:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:32,483 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-08 19:13:32,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:32,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915988491] [2024-11-08 19:13:32,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915988491] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:13:32,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135893260] [2024-11-08 19:13:32,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:32,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:13:32,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:13:32,487 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:13:32,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 19:13:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:40,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 4627 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 19:13:40,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:13:42,182 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-08 19:13:42,183 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:13:42,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135893260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:42,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 19:13:42,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2024-11-08 19:13:42,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052415540] [2024-11-08 19:13:42,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:42,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:13:42,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:42,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:13:42,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-08 19:13:42,186 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-08 19:13:46,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:46,289 INFO L93 Difference]: Finished difference Result 379 states and 521 transitions. [2024-11-08 19:13:46,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:13:46,289 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-08 19:13:46,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:46,292 INFO L225 Difference]: With dead ends: 379 [2024-11-08 19:13:46,292 INFO L226 Difference]: Without dead ends: 212 [2024-11-08 19:13:46,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-11-08 19:13:46,297 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 308 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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, 3.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:46,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 945 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-08 19:13:46,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-08 19:13:46,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-11-08 19:13:46,326 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-08 19:13:46,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 289 transitions. [2024-11-08 19:13:46,329 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 289 transitions. Word has length 181 [2024-11-08 19:13:46,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:46,330 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 289 transitions. [2024-11-08 19:13:46,330 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-08 19:13:46,330 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 289 transitions. [2024-11-08 19:13:46,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-08 19:13:46,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:46,334 INFO L215 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-08 19:13:46,369 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 19:13:46,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:13:46,535 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:46,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:46,535 INFO L85 PathProgramCache]: Analyzing trace with hash 447772293, now seen corresponding path program 1 times [2024-11-08 19:13:46,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:46,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595207808] [2024-11-08 19:13:46,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:46,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:52,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:13:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:52,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:13:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:53,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 19:13:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:53,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:13:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:53,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 19:13:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:53,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 19:13:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:53,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:13:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:53,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:13:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:53,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:13:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:53,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:13:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:53,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:13:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:53,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:13:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:53,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:13:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:53,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 19:13:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:53,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:13:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:53,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:13:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:53,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:13:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:53,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 19:13:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:53,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 19:13:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:54,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 19:13:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:54,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:13:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:54,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:13:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:54,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 19:13:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:54,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:13:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:54,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:13:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:54,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 19:13:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:54,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 19:13:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:54,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 19:13:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:54,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 19:13:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:54,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:13:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:54,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 19:13:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:54,770 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-08 19:13:54,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:54,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595207808] [2024-11-08 19:13:54,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595207808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:54,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:54,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 19:13:54,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338145165] [2024-11-08 19:13:54,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:54,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 19:13:54,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:54,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 19:13:54,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:13:54,774 INFO L87 Difference]: Start difference. First operand 212 states and 289 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (25), 6 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-08 19:13:58,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-08 19:14:03,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 19:14:07,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 19:14:11,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 19:14:30,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:30,212 INFO L93 Difference]: Finished difference Result 411 states and 561 transitions. [2024-11-08 19:14:30,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 19:14:30,213 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (25), 6 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-08 19:14:30,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:30,217 INFO L225 Difference]: With dead ends: 411 [2024-11-08 19:14:30,217 INFO L226 Difference]: Without dead ends: 245 [2024-11-08 19:14:30,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-11-08 19:14:30,220 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 250 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 216 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:30,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 578 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1042 Invalid, 4 Unknown, 0 Unchecked, 33.0s Time] [2024-11-08 19:14:30,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-08 19:14:30,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 210. [2024-11-08 19:14:30,268 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-08 19:14:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 282 transitions. [2024-11-08 19:14:30,272 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 282 transitions. Word has length 195 [2024-11-08 19:14:30,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:30,273 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 282 transitions. [2024-11-08 19:14:30,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (25), 6 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-08 19:14:30,274 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 282 transitions. [2024-11-08 19:14:30,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-08 19:14:30,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:30,278 INFO L215 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-08 19:14:30,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 19:14:30,279 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:30,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:30,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1713877896, now seen corresponding path program 1 times [2024-11-08 19:14:30,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:14:30,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399937703] [2024-11-08 19:14:30,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:30,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:14:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:40,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:14:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:40,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:14:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:40,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 19:14:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:40,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:14:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:40,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 19:14:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:41,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 19:14:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:41,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:14:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:41,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:14:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:41,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:14:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:41,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:14:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:41,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:14:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:41,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:14:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:42,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:14:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:42,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 19:14:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:43,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:14:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:43,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:14:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:43,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:14:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:43,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 19:14:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:43,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 19:14:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:43,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 19:14:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:43,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:14:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:43,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:14:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:43,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 19:14:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:43,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:14:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:43,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:14:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:43,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 19:14:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:43,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 19:14:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:43,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:14:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:43,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:14:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:43,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 19:14:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:43,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-08 19:14:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:43,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:14:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:43,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-08 19:14:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:43,664 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-08 19:14:43,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:14:43,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399937703] [2024-11-08 19:14:43,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399937703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:14:43,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:14:43,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 19:14:43,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566988337] [2024-11-08 19:14:43,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:14:43,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 19:14:43,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:14:43,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 19:14:43,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:14:43,668 INFO L87 Difference]: Start difference. First operand 210 states and 282 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 9 states have internal predecessors, (60), 6 states have call successors, (27), 6 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-08 19:14:47,738 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-08 19:14:52,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 19:14:56,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 19:15:00,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 19:15:05,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 19:15:09,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 19:15:46,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:46,430 INFO L93 Difference]: Finished difference Result 370 states and 536 transitions. [2024-11-08 19:15:46,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 19:15:46,431 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 9 states have internal predecessors, (60), 6 states have call successors, (27), 6 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-08 19:15:46,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:46,435 INFO L225 Difference]: With dead ends: 370 [2024-11-08 19:15:46,435 INFO L226 Difference]: Without dead ends: 319 [2024-11-08 19:15:46,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=158, Invalid=654, Unknown=0, NotChecked=0, Total=812 [2024-11-08 19:15:46,438 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 522 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 2048 mSolverCounterSat, 459 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 2513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 459 IncrementalHoareTripleChecker+Valid, 2048 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:46,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 968 Invalid, 2513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [459 Valid, 2048 Invalid, 6 Unknown, 0 Unchecked, 57.1s Time] [2024-11-08 19:15:46,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-08 19:15:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 236. [2024-11-08 19:15:46,488 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-08 19:15:46,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 323 transitions. [2024-11-08 19:15:46,492 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 323 transitions. Word has length 210 [2024-11-08 19:15:46,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:46,493 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 323 transitions. [2024-11-08 19:15:46,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 9 states have internal predecessors, (60), 6 states have call successors, (27), 6 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-08 19:15:46,494 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 323 transitions. [2024-11-08 19:15:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 19:15:46,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:46,497 INFO L215 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-08 19:15:46,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 19:15:46,497 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:46,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:46,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1947341260, now seen corresponding path program 1 times [2024-11-08 19:15:46,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:46,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506543938] [2024-11-08 19:15:46,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:46,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:54,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:15:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:54,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:15:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:55,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 19:15:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:55,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:15:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:55,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 19:15:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:55,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 19:15:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:15:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:15:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:15:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:15:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:15:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:15:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:15:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:15:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 19:15:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:15:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:15:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:15:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 19:15:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 19:15:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:15:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:15:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 19:15:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 19:15:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:15:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:15:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 19:15:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 19:15:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:15:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:15:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-08 19:15:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-08 19:15:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:15:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:56,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-08 19:15:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:57,276 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-08 19:15:57,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:57,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506543938] [2024-11-08 19:15:57,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506543938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:57,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:57,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 19:15:57,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454766742] [2024-11-08 19:15:57,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:57,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 19:15:57,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:57,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 19:15:57,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:15:57,281 INFO L87 Difference]: Start difference. First operand 236 states and 323 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (28), 7 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-08 19:16:01,354 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-08 19:16:05,733 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-08 19:16:10,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 19:16:14,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 19:16:18,859 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-08 19:16:32,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:16:32,829 INFO L93 Difference]: Finished difference Result 318 states and 436 transitions. [2024-11-08 19:16:32,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 19:16:32,830 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (28), 7 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-08 19:16:32,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:16:32,834 INFO L225 Difference]: With dead ends: 318 [2024-11-08 19:16:32,835 INFO L226 Difference]: Without dead ends: 271 [2024-11-08 19:16:32,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:16:32,836 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 379 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 436 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:16:32,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 778 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 913 Invalid, 5 Unknown, 0 Unchecked, 34.2s Time] [2024-11-08 19:16:32,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-08 19:16:32,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 238. [2024-11-08 19:16:32,875 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-08 19:16:32,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 325 transitions. [2024-11-08 19:16:32,878 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 325 transitions. Word has length 216 [2024-11-08 19:16:32,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:16:32,879 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 325 transitions. [2024-11-08 19:16:32,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (28), 7 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-08 19:16:32,879 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 325 transitions. [2024-11-08 19:16:32,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-08 19:16:32,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:16:32,881 INFO L215 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-08 19:16:32,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 19:16:32,882 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:16:32,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:16:32,882 INFO L85 PathProgramCache]: Analyzing trace with hash -561213031, now seen corresponding path program 1 times [2024-11-08 19:16:32,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:16:32,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309953579] [2024-11-08 19:16:32,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:16:32,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:16:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:45,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:16:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:45,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:16:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:45,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 19:16:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:47,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:16:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:47,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 19:16:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:47,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 19:16:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:48,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:16:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:48,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:16:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:48,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:16:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:48,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:16:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:48,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:16:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:48,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:16:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:49,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:16:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:49,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 19:16:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:49,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:16:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:49,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:16:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:49,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:16:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:49,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 19:16:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:49,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 19:16:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:49,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 19:16:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:50,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:16:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:50,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:16:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:50,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 19:16:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:50,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:16:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:50,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:16:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:50,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 19:16:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:50,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 19:16:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:50,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:16:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:50,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:16:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:50,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 19:16:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:50,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-08 19:16:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:50,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:16:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:50,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:16:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:50,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-08 19:16:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:50,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:16:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:50,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:16:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:50,907 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-08 19:16:50,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:16:50,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309953579] [2024-11-08 19:16:50,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309953579] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:16:50,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937475697] [2024-11-08 19:16:50,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:16:50,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:16:50,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:16:50,911 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:16:50,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 19:17:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:00,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 5008 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-08 19:17:00,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:17:00,859 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-08 19:17:04,400 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-08 19:17:04,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:17:04,601 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-08 19:17:04,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:17:04,664 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-08 19:17:18,109 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-08 19:17:18,128 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-08 19:17:22,298 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-08 19:17:22,319 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-08 19:17:30,011 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-08 19:17:30,032 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-08 19:17:34,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)))) (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-08 19:17:34,292 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-08 19:17:39,396 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-08 19:17:39,417 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-08 19:17:44,014 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-08 19:17:44,035 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-08 19:17:49,190 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-08 19:17:49,209 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-08 19:17:55,300 INFO L349 Elim1Store]: treesize reduction 36, result has 70.2 percent of original size [2024-11-08 19:17:55,301 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-08 19:17:56,069 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-08 19:17:56,069 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:18:01,451 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_24296 (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_24296) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_24295 (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_24295) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0)))) is different from false [2024-11-08 19:18:01,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937475697] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:18:01,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:18:01,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 24] total 31 [2024-11-08 19:18:01,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82145561] [2024-11-08 19:18:01,468 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:18:01,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-08 19:18:01,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:01,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-08 19:18:01,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=475, Unknown=16, NotChecked=468, Total=1056 [2024-11-08 19:18:01,472 INFO L87 Difference]: Start difference. First operand 238 states and 325 transitions. Second operand has 31 states, 27 states have (on average 4.814814814814815) internal successors, (130), 22 states have internal predecessors, (130), 13 states have call successors, (54), 11 states have call predecessors, (54), 13 states have return successors, (54), 13 states have call predecessors, (54), 13 states have call successors, (54) [2024-11-08 19:18:05,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 19:18:09,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 19:18:14,370 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-08 19:18:18,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 19:18:46,481 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-08 19:18:46,503 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-08 19:18:50,508 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#3.base)| |c_#memory_$Pointer$#3.base|) (= |c_old(#memory_$Pointer$#4.offset)| |c_#memory_$Pointer$#4.offset|) (= |c_#memory_real#4| |c_old(#memory_real#4)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_real#3)| |c_#memory_real#3|) (= |c_old(#memory_int#3)| |c_#memory_int#3|) (= |c_old(#memory_$Pointer$#4.base)| |c_#memory_$Pointer$#4.base|) (= |c_old(#memory_real#2)| |c_#memory_real#2|) (= |c_old(#memory_$Pointer$#3.offset)| |c_#memory_$Pointer$#3.offset|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_int#4)| |c_#memory_int#4|) (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))))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= |c_old(~tl_last_error~0)| c_~tl_last_error~0)) is different from false [2024-11-08 19:18:50,529 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#3.base)| |c_#memory_$Pointer$#3.base|) (= |c_old(#memory_$Pointer$#4.offset)| |c_#memory_$Pointer$#4.offset|) (= |c_#memory_real#4| |c_old(#memory_real#4)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_real#3)| |c_#memory_real#3|) (= |c_old(#memory_int#3)| |c_#memory_int#3|) (= |c_old(#memory_$Pointer$#4.base)| |c_#memory_$Pointer$#4.base|) (= |c_old(#memory_real#2)| |c_#memory_real#2|) (= |c_old(#memory_$Pointer$#3.offset)| |c_#memory_$Pointer$#3.offset|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_int#4)| |c_#memory_int#4|) (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))))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= |c_old(~tl_last_error~0)| c_~tl_last_error~0)) is different from true [2024-11-08 19:18:54,533 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#4.offset)| |c_#memory_$Pointer$#4.offset|) (= |c_#memory_real#4| |c_old(#memory_real#4)|) (= |c_old(#memory_$Pointer$#4.base)| |c_#memory_$Pointer$#4.base|) (= |c_old(#memory_int#4)| |c_#memory_int#4|) (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))))) (= |c_old(~tl_last_error~0)| c_~tl_last_error~0)) is different from false [2024-11-08 19:18:54,552 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#4.offset)| |c_#memory_$Pointer$#4.offset|) (= |c_#memory_real#4| |c_old(#memory_real#4)|) (= |c_old(#memory_$Pointer$#4.base)| |c_#memory_$Pointer$#4.base|) (= |c_old(#memory_int#4)| |c_#memory_int#4|) (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))))) (= |c_old(~tl_last_error~0)| c_~tl_last_error~0)) is different from true [2024-11-08 19:18:58,588 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-08 19:18:58,609 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-08 19:19:02,615 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-08 19:19:02,645 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-08 19:19:06,654 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-08 19:19:06,676 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-08 19:19:10,679 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-08 19:19:10,703 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-08 19:19:33,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:19:33,932 INFO L93 Difference]: Finished difference Result 557 states and 743 transitions. [2024-11-08 19:19:33,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-08 19:19:33,933 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 4.814814814814815) internal successors, (130), 22 states have internal predecessors, (130), 13 states have call successors, (54), 11 states have call predecessors, (54), 13 states have return successors, (54), 13 states have call predecessors, (54), 13 states have call successors, (54) Word has length 226 [2024-11-08 19:19:33,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:19:33,937 INFO L225 Difference]: With dead ends: 557 [2024-11-08 19:19:33,937 INFO L226 Difference]: Without dead ends: 344 [2024-11-08 19:19:33,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 419 SyntacticMatches, 11 SemanticMatches, 64 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 76.9s TimeCoverageRelationStatistics Valid=458, Invalid=2026, Unknown=30, NotChecked=1776, Total=4290 [2024-11-08 19:19:33,942 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 556 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 2361 mSolverCounterSat, 381 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 7273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 2361 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 4522 IncrementalHoareTripleChecker+Unchecked, 54.6s IncrementalHoareTripleChecker+Time [2024-11-08 19:19:33,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 809 Invalid, 7273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 2361 Invalid, 9 Unknown, 4522 Unchecked, 54.6s Time] [2024-11-08 19:19:33,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-08 19:19:34,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 295. [2024-11-08 19:19:34,006 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-08 19:19:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 392 transitions. [2024-11-08 19:19:34,010 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 392 transitions. Word has length 226 [2024-11-08 19:19:34,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:19:34,011 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 392 transitions. [2024-11-08 19:19:34,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 4.814814814814815) internal successors, (130), 22 states have internal predecessors, (130), 13 states have call successors, (54), 11 states have call predecessors, (54), 13 states have return successors, (54), 13 states have call predecessors, (54), 13 states have call successors, (54) [2024-11-08 19:19:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 392 transitions. [2024-11-08 19:19:34,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-08 19:19:34,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:19:34,015 INFO L215 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-08 19:19:34,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 19:19:34,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:19:34,216 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:19:34,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:19:34,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1525028899, now seen corresponding path program 1 times [2024-11-08 19:19:34,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:19:34,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289297418] [2024-11-08 19:19:34,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:19:34,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:19:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:48,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:19:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:48,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:19:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:48,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 19:19:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:49,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:19:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:49,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 19:19:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:49,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 19:19:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:50,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:19:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:50,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:19:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:50,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:19:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:50,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:19:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:50,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:19:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:50,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:19:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:51,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:19:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:51,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:19:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:51,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 19:19:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:51,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:19:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:51,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:19:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:51,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:19:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:51,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 19:19:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:52,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 19:19:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:52,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:19:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:52,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:19:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:52,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 19:19:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:52,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 19:19:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:52,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:19:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:52,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:19:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:52,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 19:19:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:52,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 19:19:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:52,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:19:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:52,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:19:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:52,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-08 19:19:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:52,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-08 19:19:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:52,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:19:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:53,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:19:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:53,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-08 19:19:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:53,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:19:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:53,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:19:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:53,199 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-08 19:19:53,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:19:53,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289297418] [2024-11-08 19:19:53,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289297418] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:19:53,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006003657] [2024-11-08 19:19:53,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:19:53,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:19:53,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:19:53,202 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:19:53,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 19:20:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:01,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 5045 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 19:20:01,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:20:02,772 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-08 19:20:04,467 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-08 19:20:09,122 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-08 19:20:09,123 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:20:09,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006003657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:20:09,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 19:20:09,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 28 [2024-11-08 19:20:09,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066642944] [2024-11-08 19:20:09,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:20:09,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 19:20:09,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:20:09,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 19:20:09,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2024-11-08 19:20:09,126 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-08 19:20:13,157 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-08 19:20:17,953 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-08 19:20:29,206 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-08 19:20:36,918 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-08 19:20:41,049 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-08 19:20:45,170 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-08 19:20:49,948 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-08 19:20:54,117 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-08 19:20:58,943 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-08 19:21:08,578 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-08 19:21:11,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:21:11,347 INFO L93 Difference]: Finished difference Result 613 states and 807 transitions. [2024-11-08 19:21:11,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 19:21:11,348 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-08 19:21:11,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:21:11,353 INFO L225 Difference]: With dead ends: 613 [2024-11-08 19:21:11,353 INFO L226 Difference]: Without dead ends: 435 [2024-11-08 19:21:11,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 289 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=115, Invalid=1007, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 19:21:11,356 INFO L432 NwaCegarLoop]: 411 mSDtfsCounter, 219 mSDsluCounter, 2309 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 42 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59.7s IncrementalHoareTripleChecker+Time [2024-11-08 19:21:11,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 2720 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1297 Invalid, 10 Unknown, 0 Unchecked, 59.7s Time] [2024-11-08 19:21:11,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-08 19:21:11,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 427. [2024-11-08 19:21:11,447 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-08 19:21:11,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 563 transitions. [2024-11-08 19:21:11,451 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 563 transitions. Word has length 232 [2024-11-08 19:21:11,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:21:11,452 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 563 transitions. [2024-11-08 19:21:11,453 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-08 19:21:11,453 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 563 transitions. [2024-11-08 19:21:11,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-08 19:21:11,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:21:11,455 INFO L215 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-08 19:21:11,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 19:21:11,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:21:11,656 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:21:11,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:21:11,657 INFO L85 PathProgramCache]: Analyzing trace with hash -293180649, now seen corresponding path program 1 times [2024-11-08 19:21:11,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:21:11,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503080205] [2024-11-08 19:21:11,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:21:11,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:21:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:25,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:21:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:25,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:21:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:25,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 19:21:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:26,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:21:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:26,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 19:21:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:27,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 19:21:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:27,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:21:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:27,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:21:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:27,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:21:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:27,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:21:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:27,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:21:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:27,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:21:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:29,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:21:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:29,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:21:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:29,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 19:21:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:29,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:21:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:29,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:21:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:29,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:21:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:29,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 19:21:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:29,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 19:21:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:29,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:21:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:30,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:21:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:30,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 19:21:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:30,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 19:21:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:30,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:21:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:30,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:21:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:30,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 19:21:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:30,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 19:21:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:30,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:21:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:30,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:21:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:30,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-08 19:21:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:30,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-08 19:21:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:30,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:21:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:30,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:21:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:30,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 19:21:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:30,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:21:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:30,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:21:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:30,530 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-08 19:21:30,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:21:30,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503080205] [2024-11-08 19:21:30,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503080205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:21:30,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374006810] [2024-11-08 19:21:30,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:21:30,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:21:30,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:21:30,533 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:21:30,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 19:21:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:39,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 5050 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-08 19:21:39,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:21:39,417 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-08 19:21:42,463 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-08 19:21:42,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:21:42,695 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-08 19:21:42,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:21:42,810 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-08 19:21:50,483 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-08 19:21:50,509 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-08 19:21:55,445 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-08 19:21:55,467 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-08 19:21:59,639 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-08 19:21:59,660 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-08 19:22:07,544 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-08 19:22:07,565 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-08 19:22:11,779 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-08 19:22:11,800 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-08 19:22:16,884 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-08 19:22:16,906 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-08 19:22:21,674 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-08 19:22:21,696 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-08 19:22:27,094 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-08 19:22:27,115 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-08 19:22:31,306 INFO L224 Elim1Store]: Index analysis took 117 ms [2024-11-08 19:22:33,431 INFO L349 Elim1Store]: treesize reduction 36, result has 70.2 percent of original size [2024-11-08 19:22:33,432 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-08 19:22:34,030 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-08 19:22:34,030 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:22:39,161 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_30620 (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_30620) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_30619 (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_30619) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0)))) is different from false [2024-11-08 19:22:39,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374006810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:22:39,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:22:39,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25] total 33 [2024-11-08 19:22:39,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804373591] [2024-11-08 19:22:39,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:22:39,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-08 19:22:39,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:22:39,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-08 19:22:39,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=564, Unknown=16, NotChecked=504, Total=1190 [2024-11-08 19:22:39,177 INFO L87 Difference]: Start difference. First operand 427 states and 563 transitions. Second operand has 33 states, 29 states have (on average 4.896551724137931) internal successors, (142), 23 states have internal predecessors, (142), 14 states have call successors, (56), 12 states have call predecessors, (56), 13 states have return successors, (55), 14 states have call predecessors, (55), 14 states have call successors, (55) [2024-11-08 19:22:43,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 19:22:47,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 19:22:52,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 19:22:56,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 19:23:25,079 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-08 19:23:25,100 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-08 19:23:29,103 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#3.base)| |c_#memory_$Pointer$#3.base|) (= |c_old(#memory_$Pointer$#4.offset)| |c_#memory_$Pointer$#4.offset|) (= |c_#memory_real#4| |c_old(#memory_real#4)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_real#3)| |c_#memory_real#3|) (= |c_old(#memory_int#3)| |c_#memory_int#3|) (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$#4.base)| |c_#memory_$Pointer$#4.base|) (= |c_old(#memory_real#2)| |c_#memory_real#2|) (= |c_old(#memory_$Pointer$#3.offset)| |c_#memory_$Pointer$#3.offset|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_int#4)| |c_#memory_int#4|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= |c_old(~tl_last_error~0)| c_~tl_last_error~0)) is different from false [2024-11-08 19:23:29,126 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#3.base)| |c_#memory_$Pointer$#3.base|) (= |c_old(#memory_$Pointer$#4.offset)| |c_#memory_$Pointer$#4.offset|) (= |c_#memory_real#4| |c_old(#memory_real#4)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_real#3)| |c_#memory_real#3|) (= |c_old(#memory_int#3)| |c_#memory_int#3|) (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$#4.base)| |c_#memory_$Pointer$#4.base|) (= |c_old(#memory_real#2)| |c_#memory_real#2|) (= |c_old(#memory_$Pointer$#3.offset)| |c_#memory_$Pointer$#3.offset|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_int#4)| |c_#memory_int#4|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= |c_old(~tl_last_error~0)| c_~tl_last_error~0)) is different from true [2024-11-08 19:23:33,131 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#4.offset)| |c_#memory_$Pointer$#4.offset|) (= |c_#memory_real#4| |c_old(#memory_real#4)|) (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$#4.base)| |c_#memory_$Pointer$#4.base|) (= |c_old(#memory_int#4)| |c_#memory_int#4|) (= |c_old(~tl_last_error~0)| c_~tl_last_error~0)) is different from false [2024-11-08 19:23:33,151 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#4.offset)| |c_#memory_$Pointer$#4.offset|) (= |c_#memory_real#4| |c_old(#memory_real#4)|) (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$#4.base)| |c_#memory_$Pointer$#4.base|) (= |c_old(#memory_int#4)| |c_#memory_int#4|) (= |c_old(~tl_last_error~0)| c_~tl_last_error~0)) is different from true [2024-11-08 19:23:37,174 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-08 19:23:37,195 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-08 19:23:41,200 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#3.base)| |c_#memory_$Pointer$#3.base|) (= |c_old(#memory_$Pointer$#4.offset)| |c_#memory_$Pointer$#4.offset|) (= |c_#memory_real#4| |c_old(#memory_real#4)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_real#3)| |c_#memory_real#3|) (= |c_old(#memory_int#3)| |c_#memory_int#3|) (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$#4.base)| |c_#memory_$Pointer$#4.base|) (= |c_old(#memory_real#2)| |c_#memory_real#2|) (= |c_old(#memory_$Pointer$#3.offset)| |c_#memory_$Pointer$#3.offset|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.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)))) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_int#4)| |c_#memory_int#4|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= |c_old(~tl_last_error~0)| c_~tl_last_error~0)) is different from false [2024-11-08 19:23:41,222 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#3.base)| |c_#memory_$Pointer$#3.base|) (= |c_old(#memory_$Pointer$#4.offset)| |c_#memory_$Pointer$#4.offset|) (= |c_#memory_real#4| |c_old(#memory_real#4)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_real#3)| |c_#memory_real#3|) (= |c_old(#memory_int#3)| |c_#memory_int#3|) (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$#4.base)| |c_#memory_$Pointer$#4.base|) (= |c_old(#memory_real#2)| |c_#memory_real#2|) (= |c_old(#memory_$Pointer$#3.offset)| |c_#memory_$Pointer$#3.offset|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.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)))) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_int#4)| |c_#memory_int#4|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= |c_old(~tl_last_error~0)| c_~tl_last_error~0)) is different from true [2024-11-08 19:23:45,226 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-08 19:23:45,247 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-08 19:23:49,250 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-08 19:23:49,270 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-08 19:23:53,276 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#3.base)| |c_#memory_$Pointer$#3.base|) (= |c_old(#memory_$Pointer$#4.offset)| |c_#memory_$Pointer$#4.offset|) (= |c_#memory_real#4| |c_old(#memory_real#4)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_real#3)| |c_#memory_real#3|) (= |c_old(#memory_int#3)| |c_#memory_int#3|) (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$#4.base)| |c_#memory_$Pointer$#4.base|) (= |c_old(#memory_real#2)| |c_#memory_real#2|) (= |c_old(#memory_$Pointer$#3.offset)| |c_#memory_$Pointer$#3.offset|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.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)))) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_int#4)| |c_#memory_int#4|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= |c_old(~tl_last_error~0)| c_~tl_last_error~0)) is different from false [2024-11-08 19:23:53,297 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#3.base)| |c_#memory_$Pointer$#3.base|) (= |c_old(#memory_$Pointer$#4.offset)| |c_#memory_$Pointer$#4.offset|) (= |c_#memory_real#4| |c_old(#memory_real#4)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_real#3)| |c_#memory_real#3|) (= |c_old(#memory_int#3)| |c_#memory_int#3|) (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$#4.base)| |c_#memory_$Pointer$#4.base|) (= |c_old(#memory_real#2)| |c_#memory_real#2|) (= |c_old(#memory_$Pointer$#3.offset)| |c_#memory_$Pointer$#3.offset|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.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)))) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_int#4)| |c_#memory_int#4|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= |c_old(~tl_last_error~0)| c_~tl_last_error~0)) is different from true [2024-11-08 19:23:57,300 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-08 19:23:57,320 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-08 19:24:01,323 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-08 19:24:01,350 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-08 19:24:16,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:24:16,458 INFO L93 Difference]: Finished difference Result 778 states and 1034 transitions. [2024-11-08 19:24:16,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-08 19:24:16,459 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 4.896551724137931) internal successors, (142), 23 states have internal predecessors, (142), 14 states have call successors, (56), 12 states have call predecessors, (56), 13 states have return successors, (55), 14 states have call predecessors, (55), 14 states have call successors, (55) Word has length 234 [2024-11-08 19:24:16,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:24:16,464 INFO L225 Difference]: With dead ends: 778 [2024-11-08 19:24:16,464 INFO L226 Difference]: Without dead ends: 457 [2024-11-08 19:24:16,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 429 SyntacticMatches, 11 SemanticMatches, 70 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 88.8s TimeCoverageRelationStatistics Valid=501, Invalid=2295, Unknown=36, NotChecked=2280, Total=5112 [2024-11-08 19:24:16,469 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 765 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 1949 mSolverCounterSat, 590 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 7210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 590 IncrementalHoareTripleChecker+Valid, 1949 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 4662 IncrementalHoareTripleChecker+Unchecked, 46.7s IncrementalHoareTripleChecker+Time [2024-11-08 19:24:16,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 709 Invalid, 7210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [590 Valid, 1949 Invalid, 9 Unknown, 4662 Unchecked, 46.7s Time] [2024-11-08 19:24:16,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-08 19:24:16,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 386. [2024-11-08 19:24:16,550 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-08 19:24:16,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 511 transitions. [2024-11-08 19:24:16,554 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 511 transitions. Word has length 234 [2024-11-08 19:24:16,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:24:16,555 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 511 transitions. [2024-11-08 19:24:16,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 4.896551724137931) internal successors, (142), 23 states have internal predecessors, (142), 14 states have call successors, (56), 12 states have call predecessors, (56), 13 states have return successors, (55), 14 states have call predecessors, (55), 14 states have call successors, (55) [2024-11-08 19:24:16,556 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 511 transitions. [2024-11-08 19:24:16,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-08 19:24:16,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:24:16,559 INFO L215 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-08 19:24:16,606 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 19:24:16,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:24:16,763 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:24:16,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:16,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1632454995, now seen corresponding path program 1 times [2024-11-08 19:24:16,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:16,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546464878] [2024-11-08 19:24:16,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:16,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:32,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:24:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:32,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:24:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:33,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 19:24:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:34,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:24:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:35,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:24:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:35,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 19:24:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:35,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 19:24:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:24:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:24:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:24:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 19:24:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:24:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:24:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 19:24:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:24:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 19:24:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 19:24:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:24:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:24:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 19:24:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:24:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:24:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 19:24:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 19:24:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-08 19:24:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:24:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:24:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 19:24:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 19:24:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:24:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:24:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-08 19:24:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-08 19:24:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:24:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:24:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 19:24:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 19:24:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 19:24:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,848 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 473 trivial. 0 not checked. [2024-11-08 19:24:39,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:39,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546464878] [2024-11-08 19:24:39,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546464878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:24:39,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503340219] [2024-11-08 19:24:39,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:39,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:24:39,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:24:39,851 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:24:39,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4e17ef-5fcd-468e-a48e-0c90f187bde3/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 19:24:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:49,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 5087 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 19:24:49,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:24:50,476 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-08 19:24:52,595 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-08 19:24:57,665 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-08 19:24:57,666 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:24:57,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503340219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:24:57,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 19:24:57,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [19] total 29 [2024-11-08 19:24:57,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154256978] [2024-11-08 19:24:57,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:24:57,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 19:24:57,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:57,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 19:24:57,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2024-11-08 19:24:57,671 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)