./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 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/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_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC --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.3.0-dev-6497de0 [2024-11-23 23:11:06,862 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 23:11:06,988 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-23 23:11:06,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 23:11:07,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 23:11:07,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 23:11:07,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 23:11:07,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 23:11:07,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 23:11:07,046 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 23:11:07,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 23:11:07,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 23:11:07,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 23:11:07,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 23:11:07,048 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 23:11:07,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 23:11:07,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 23:11:07,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 23:11:07,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 23:11:07,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 23:11:07,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 23:11:07,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 23:11:07,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 23:11:07,051 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 23:11:07,051 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 23:11:07,052 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 23:11:07,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:11:07,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:11:07,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:11:07,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:11:07,052 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 23:11:07,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:11:07,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:11:07,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:11:07,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:11:07,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 23:11:07,053 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 23:11:07,053 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-23 23:11:07,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 23:11:07,053 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 23:11:07,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 23:11:07,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 23:11:07,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 23:11:07,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 23:11:07,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 23:11:07,054 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC 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-23 23:11:07,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 23:11:07,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 23:11:07,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 23:11:07,477 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 23:11:07,478 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 23:11:07,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i [2024-11-23 23:11:10,975 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/data/3d609929f/b48d26efc0094b40be11c8b00ffca757/FLAGe2adcb3b8 [2024-11-23 23:11:11,837 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 23:11:11,840 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i [2024-11-23 23:11:11,899 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/data/3d609929f/b48d26efc0094b40be11c8b00ffca757/FLAGe2adcb3b8 [2024-11-23 23:11:11,918 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/data/3d609929f/b48d26efc0094b40be11c8b00ffca757 [2024-11-23 23:11:11,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 23:11:11,923 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 23:11:11,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 23:11:11,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 23:11:11,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 23:11:11,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:11:11" (1/1) ... [2024-11-23 23:11:11,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2632fafd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:11, skipping insertion in model container [2024-11-23 23:11:11,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:11:11" (1/1) ... [2024-11-23 23:11:12,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 23:11:12,423 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_982580cd-30a3-4d49-afed-d87c121f45db/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i[4493,4506] [2024-11-23 23:11:12,431 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_982580cd-30a3-4d49-afed-d87c121f45db/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i[4553,4566] [2024-11-23 23:11:13,639 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:13,640 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:13,641 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:13,642 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:13,643 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:13,660 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:13,661 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:13,663 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:13,664 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:13,669 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:13,672 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:13,674 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:13,677 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:14,490 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:14,490 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:14,499 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:14,507 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:14,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:11:14,613 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 23:11:14,630 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_982580cd-30a3-4d49-afed-d87c121f45db/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i[4493,4506] [2024-11-23 23:11:14,631 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_982580cd-30a3-4d49-afed-d87c121f45db/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness.i[4553,4566] [2024-11-23 23:11:14,742 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:14,742 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:14,743 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:14,744 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:14,744 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:14,760 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:14,762 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:14,764 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:14,765 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:14,768 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:14,769 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:14,770 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:14,770 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:14,964 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:14,968 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:14,970 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:14,977 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 23:11:14,986 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7775-7786] [2024-11-23 23:11:15,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:11:15,392 INFO L204 MainTranslator]: Completed translation [2024-11-23 23:11:15,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:15 WrapperNode [2024-11-23 23:11:15,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 23:11:15,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 23:11:15,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 23:11:15,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 23:11:15,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:15" (1/1) ... [2024-11-23 23:11:15,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:15" (1/1) ... [2024-11-23 23:11:15,613 INFO L138 Inliner]: procedures = 680, calls = 1678, calls flagged for inlining = 52, calls inlined = 7, statements flattened = 718 [2024-11-23 23:11:15,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 23:11:15,614 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 23:11:15,614 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 23:11:15,614 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 23:11:15,625 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:15" (1/1) ... [2024-11-23 23:11:15,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:15" (1/1) ... [2024-11-23 23:11:15,634 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:15" (1/1) ... [2024-11-23 23:11:15,743 INFO L175 MemorySlicer]: Split 313 memory accesses to 5 slices as follows [238, 2, 9, 7, 57]. 76 percent of accesses are in the largest equivalence class. The 24 initializations are split as follows [6, 2, 1, 5, 10]. The 241 writes are split as follows [232, 0, 1, 1, 7]. [2024-11-23 23:11:15,743 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:15" (1/1) ... [2024-11-23 23:11:15,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:15" (1/1) ... [2024-11-23 23:11:15,794 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:15" (1/1) ... [2024-11-23 23:11:15,797 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:15" (1/1) ... [2024-11-23 23:11:15,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:15" (1/1) ... [2024-11-23 23:11:15,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:15" (1/1) ... [2024-11-23 23:11:15,825 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:15" (1/1) ... [2024-11-23 23:11:15,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 23:11:15,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 23:11:15,843 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 23:11:15,843 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 23:11:15,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:15" (1/1) ... [2024-11-23 23:11:15,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:11:15,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:11:15,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 23:11:15,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 23:11:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 23:11:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2024-11-23 23:11:15,926 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2024-11-23 23:11:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2024-11-23 23:11:15,927 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2024-11-23 23:11:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2024-11-23 23:11:15,927 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2024-11-23 23:11:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2024-11-23 23:11:15,927 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2024-11-23 23:11:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-23 23:11:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-23 23:11:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-23 23:11:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-23 23:11:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-23 23:11:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-23 23:11:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-23 23:11:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-23 23:11:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-23 23:11:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-23 23:11:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2024-11-23 23:11:15,928 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2024-11-23 23:11:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-23 23:11:15,928 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-23 23:11:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-23 23:11:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 23:11:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-23 23:11:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-23 23:11:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-23 23:11:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-23 23:11:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-23 23:11:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_impl [2024-11-23 23:11:15,928 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_impl [2024-11-23 23:11:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 23:11:15,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 23:11:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2024-11-23 23:11:15,929 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2024-11-23 23:11:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2024-11-23 23:11:15,929 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2024-11-23 23:11:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-23 23:11:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-23 23:11:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-11-23 23:11:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-11-23 23:11:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-11-23 23:11:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2024-11-23 23:11:15,929 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2024-11-23 23:11:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2024-11-23 23:11:15,929 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2024-11-23 23:11:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-23 23:11:15,930 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-23 23:11:15,930 INFO L130 BoogieDeclarations]: Found specification of procedure my_memcpy [2024-11-23 23:11:15,933 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memcpy [2024-11-23 23:11:15,933 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2024-11-23 23:11:15,933 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2024-11-23 23:11:15,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-23 23:11:15,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-23 23:11:15,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-23 23:11:15,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-23 23:11:15,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-23 23:11:15,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-23 23:11:15,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-23 23:11:15,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-23 23:11:15,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-23 23:11:15,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-23 23:11:15,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-23 23:11:15,936 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2024-11-23 23:11:15,936 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2024-11-23 23:11:15,936 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2024-11-23 23:11:15,936 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2024-11-23 23:11:15,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-23 23:11:15,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-23 23:11:15,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-23 23:11:15,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-23 23:11:15,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-23 23:11:15,937 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2024-11-23 23:11:15,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2024-11-23 23:11:15,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 23:11:15,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-23 23:11:15,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-23 23:11:15,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-23 23:11:15,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-23 23:11:16,391 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 23:11:16,395 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 23:11:23,412 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-23 23:11:23,412 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 23:11:23,436 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 23:11:23,440 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-23 23:11:23,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:11:23 BoogieIcfgContainer [2024-11-23 23:11:23,441 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 23:11:23,443 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 23:11:23,443 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 23:11:23,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 23:11:23,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:11:11" (1/3) ... [2024-11-23 23:11:23,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761d749b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:11:23, skipping insertion in model container [2024-11-23 23:11:23,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:11:15" (2/3) ... [2024-11-23 23:11:23,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761d749b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:11:23, skipping insertion in model container [2024-11-23 23:11:23,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:11:23" (3/3) ... [2024-11-23 23:11:23,457 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_array_list_copy_harness.i [2024-11-23 23:11:23,478 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 23:11:23,479 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_array_list_copy_harness.i that has 18 procedures, 209 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-23 23:11:23,564 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 23:11:23,580 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;@442dd9c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 23:11:23,581 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-23 23:11:23,587 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-23 23:11:23,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-23 23:11:23,610 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:11:23,611 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:11:23,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:11:23,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:11:23,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1329126664, now seen corresponding path program 1 times [2024-11-23 23:11:23,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:11:23,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427465469] [2024-11-23 23:11:23,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:11:23,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:11:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:11:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-11-23 23:11:34,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:11:34,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427465469] [2024-11-23 23:11:34,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427465469] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:11:34,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837950415] [2024-11-23 23:11:34,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:11:34,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:11:34,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:11:34,035 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:11:34,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 23:11:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:11:42,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 4363 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-23 23:11:42,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:11:42,616 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2024-11-23 23:11:42,617 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:11:42,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837950415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:11:42,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 23:11:42,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-23 23:11:42,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955458009] [2024-11-23 23:11:42,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:11:42,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-23 23:11:42,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:11:42,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-23 23:11:42,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 23:11:42,655 INFO L87 Difference]: Start difference. First operand has 209 states, 119 states have (on average 1.184873949579832) internal successors, (141), 120 states have internal predecessors, (141), 71 states have call successors, (71), 17 states have call predecessors, (71), 17 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-23 23:11:42,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:11:42,750 INFO L93 Difference]: Finished difference Result 414 states and 603 transitions. [2024-11-23 23:11:42,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-23 23:11:42,752 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 145 [2024-11-23 23:11:42,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:11:42,764 INFO L225 Difference]: With dead ends: 414 [2024-11-23 23:11:42,764 INFO L226 Difference]: Without dead ends: 204 [2024-11-23 23:11:42,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 23:11:42,775 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:11:42,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:11:42,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-23 23:11:42,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-23 23:11:42,848 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-23 23:11:42,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 276 transitions. [2024-11-23 23:11:42,861 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 276 transitions. Word has length 145 [2024-11-23 23:11:42,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:11:42,863 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 276 transitions. [2024-11-23 23:11:42,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-23 23:11:42,863 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 276 transitions. [2024-11-23 23:11:42,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-23 23:11:42,868 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:11:42,868 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:11:42,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-23 23:11:43,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-23 23:11:43,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:11:43,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:11:43,072 INFO L85 PathProgramCache]: Analyzing trace with hash -433130932, now seen corresponding path program 1 times [2024-11-23 23:11:43,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:11:43,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174586496] [2024-11-23 23:11:43,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:11:43,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:11:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:11:52,282 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-23 23:11:52,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:11:52,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174586496] [2024-11-23 23:11:52,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174586496] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:11:52,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846917938] [2024-11-23 23:11:52,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:11:52,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:11:52,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:11:52,288 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:11:52,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 23:12:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:12:00,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 4363 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 23:12:00,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:12:01,020 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-23 23:12:01,021 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:12:01,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846917938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:12:01,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 23:12:01,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-11-23 23:12:01,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781878374] [2024-11-23 23:12:01,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:12:01,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:12:01,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:12:01,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:12:01,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:12:01,025 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-23 23:12:01,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:12:01,121 INFO L93 Difference]: Finished difference Result 403 states and 547 transitions. [2024-11-23 23:12:01,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:12:01,123 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-23 23:12:01,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:12:01,127 INFO L225 Difference]: With dead ends: 403 [2024-11-23 23:12:01,127 INFO L226 Difference]: Without dead ends: 205 [2024-11-23 23:12:01,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:12:01,131 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 0 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:12:01,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 546 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:12:01,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-23 23:12:01,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-23 23:12:01,162 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-23 23:12:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 277 transitions. [2024-11-23 23:12:01,167 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 277 transitions. Word has length 145 [2024-11-23 23:12:01,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:12:01,168 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 277 transitions. [2024-11-23 23:12:01,168 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-23 23:12:01,169 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 277 transitions. [2024-11-23 23:12:01,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-23 23:12:01,176 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:12:01,176 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:12:01,206 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-23 23:12:01,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:12:01,380 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:12:01,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:12:01,381 INFO L85 PathProgramCache]: Analyzing trace with hash 995250632, now seen corresponding path program 1 times [2024-11-23 23:12:01,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:12:01,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559242009] [2024-11-23 23:12:01,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:12:01,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:12:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:12:10,131 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-23 23:12:10,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:12:10,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559242009] [2024-11-23 23:12:10,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559242009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:12:10,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146870190] [2024-11-23 23:12:10,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:12:10,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:12:10,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:12:10,138 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:12:10,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-23 23:12:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:12:19,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 4369 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 23:12:19,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:12:20,027 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-23 23:12:20,027 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:12:20,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146870190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:12:20,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 23:12:20,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2024-11-23 23:12:20,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742929906] [2024-11-23 23:12:20,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:12:20,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:12:20,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:12:20,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:12:20,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-23 23:12:20,031 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-23 23:12:23,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:12:23,003 INFO L93 Difference]: Finished difference Result 405 states and 558 transitions. [2024-11-23 23:12:23,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:12:23,005 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-23 23:12:23,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:12:23,014 INFO L225 Difference]: With dead ends: 405 [2024-11-23 23:12:23,014 INFO L226 Difference]: Without dead ends: 207 [2024-11-23 23:12:23,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-23 23:12:23,021 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 282 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:12:23,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 779 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-23 23:12:23,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-23 23:12:23,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-23 23:12:23,101 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-23 23:12:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 290 transitions. [2024-11-23 23:12:23,114 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 290 transitions. Word has length 145 [2024-11-23 23:12:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:12:23,115 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 290 transitions. [2024-11-23 23:12:23,115 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-23 23:12:23,115 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 290 transitions. [2024-11-23 23:12:23,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-23 23:12:23,124 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:12:23,125 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:12:23,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-23 23:12:23,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:12:23,329 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:12:23,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:12:23,330 INFO L85 PathProgramCache]: Analyzing trace with hash -139108393, now seen corresponding path program 1 times [2024-11-23 23:12:23,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:12:23,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016259622] [2024-11-23 23:12:23,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:12:23,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:12:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:12:32,400 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-23 23:12:32,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:12:32,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016259622] [2024-11-23 23:12:32,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016259622] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:12:32,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758203345] [2024-11-23 23:12:32,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:12:32,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:12:32,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:12:32,406 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:12:32,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-23 23:12:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:12:42,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 4496 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 23:12:42,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:12:43,041 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-23 23:12:43,041 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:12:43,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758203345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:12:43,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 23:12:43,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2024-11-23 23:12:43,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086914367] [2024-11-23 23:12:43,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:12:43,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:12:43,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:12:43,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:12:43,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-23 23:12:43,045 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-23 23:12:45,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:12:45,643 INFO L93 Difference]: Finished difference Result 380 states and 530 transitions. [2024-11-23 23:12:45,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:12:45,644 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-23 23:12:45,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:12:45,648 INFO L225 Difference]: With dead ends: 380 [2024-11-23 23:12:45,648 INFO L226 Difference]: Without dead ends: 207 [2024-11-23 23:12:45,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-23 23:12:45,651 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 280 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:12:45,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 782 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-23 23:12:45,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-23 23:12:45,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-23 23:12:45,678 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-23 23:12:45,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 288 transitions. [2024-11-23 23:12:45,682 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 288 transitions. Word has length 160 [2024-11-23 23:12:45,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:12:45,683 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 288 transitions. [2024-11-23 23:12:45,683 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-23 23:12:45,684 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 288 transitions. [2024-11-23 23:12:45,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-23 23:12:45,687 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:12:45,687 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:12:45,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-23 23:12:45,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:12:45,888 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:12:45,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:12:45,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1577477002, now seen corresponding path program 2 times [2024-11-23 23:12:45,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:12:45,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600064395] [2024-11-23 23:12:45,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:12:45,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:12:52,556 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 23:12:52,556 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:12:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-11-23 23:12:53,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:12:53,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600064395] [2024-11-23 23:12:53,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600064395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:12:53,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:12:53,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:12:53,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951640040] [2024-11-23 23:12:53,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:12:53,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:12:53,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:12:53,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:12:53,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:12:53,688 INFO L87 Difference]: Start difference. First operand 207 states and 288 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-23 23:12:53,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:12:53,901 INFO L93 Difference]: Finished difference Result 266 states and 364 transitions. [2024-11-23 23:12:53,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:12:53,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 175 [2024-11-23 23:12:53,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:12:53,908 INFO L225 Difference]: With dead ends: 266 [2024-11-23 23:12:53,909 INFO L226 Difference]: Without dead ends: 212 [2024-11-23 23:12:53,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:12:53,910 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 0 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:12:53,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1086 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:12:53,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-23 23:12:53,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-11-23 23:12:53,932 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-23 23:12:53,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 294 transitions. [2024-11-23 23:12:53,936 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 294 transitions. Word has length 175 [2024-11-23 23:12:53,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:12:53,937 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 294 transitions. [2024-11-23 23:12:53,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-23 23:12:53,938 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 294 transitions. [2024-11-23 23:12:53,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-23 23:12:53,945 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:12:53,945 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:12:53,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-23 23:12:53,945 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:12:53,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:12:53,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1443434910, now seen corresponding path program 1 times [2024-11-23 23:12:53,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:12:53,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902297572] [2024-11-23 23:12:53,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:12:53,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:13:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:13:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-23 23:13:04,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:13:04,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902297572] [2024-11-23 23:13:04,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902297572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:13:04,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928391390] [2024-11-23 23:13:04,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:13:04,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:13:04,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:13:04,507 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:13:04,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-23 23:13:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:13:13,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 4627 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-23 23:13:13,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:13:14,676 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-23 23:13:14,676 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:13:14,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928391390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:13:14,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 23:13:14,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2024-11-23 23:13:14,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70698441] [2024-11-23 23:13:14,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:13:14,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 23:13:14,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:13:14,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 23:13:14,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-23 23:13:14,679 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-23 23:13:17,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:13:17,850 INFO L93 Difference]: Finished difference Result 379 states and 521 transitions. [2024-11-23 23:13:17,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 23:13:17,851 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-23 23:13:17,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:13:17,858 INFO L225 Difference]: With dead ends: 379 [2024-11-23 23:13:17,858 INFO L226 Difference]: Without dead ends: 212 [2024-11-23 23:13:17,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-11-23 23:13:17,860 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 308 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-23 23:13:17,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 945 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-23 23:13:17,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-23 23:13:17,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-11-23 23:13:17,890 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-23 23:13:17,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 289 transitions. [2024-11-23 23:13:17,894 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 289 transitions. Word has length 181 [2024-11-23 23:13:17,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:13:17,896 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 289 transitions. [2024-11-23 23:13:17,896 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-23 23:13:17,896 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 289 transitions. [2024-11-23 23:13:17,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-23 23:13:17,901 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:13:17,901 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:13:17,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-23 23:13:18,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-23 23:13:18,102 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:13:18,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:13:18,103 INFO L85 PathProgramCache]: Analyzing trace with hash 447772293, now seen corresponding path program 1 times [2024-11-23 23:13:18,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:13:18,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110796537] [2024-11-23 23:13:18,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:13:18,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:13:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:13:26,194 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-23 23:13:26,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:13:26,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110796537] [2024-11-23 23:13:26,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110796537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:13:26,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:13:26,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 23:13:26,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463953453] [2024-11-23 23:13:26,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:13:26,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:13:26,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:13:26,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:13:26,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:13:26,197 INFO L87 Difference]: Start difference. First operand 212 states and 289 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-23 23:13:27,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:13:27,190 INFO L93 Difference]: Finished difference Result 376 states and 506 transitions. [2024-11-23 23:13:27,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:13:27,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 195 [2024-11-23 23:13:27,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:13:27,194 INFO L225 Difference]: With dead ends: 376 [2024-11-23 23:13:27,195 INFO L226 Difference]: Without dead ends: 210 [2024-11-23 23:13:27,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:13:27,197 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 46 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:13:27,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1092 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-23 23:13:27,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-23 23:13:27,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2024-11-23 23:13:27,215 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-23 23:13:27,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 282 transitions. [2024-11-23 23:13:27,219 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 282 transitions. Word has length 195 [2024-11-23 23:13:27,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:13:27,219 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 282 transitions. [2024-11-23 23:13:27,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-23 23:13:27,220 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 282 transitions. [2024-11-23 23:13:27,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-23 23:13:27,224 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:13:27,224 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:13:27,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-23 23:13:27,224 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:13:27,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:13:27,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1713877896, now seen corresponding path program 1 times [2024-11-23 23:13:27,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:13:27,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072184404] [2024-11-23 23:13:27,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:13:27,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:13:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:13:38,071 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-23 23:13:38,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:13:38,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072184404] [2024-11-23 23:13:38,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072184404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:13:38,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:13:38,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-23 23:13:38,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383989316] [2024-11-23 23:13:38,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:13:38,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-23 23:13:38,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:13:38,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-23 23:13:38,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-23 23:13:38,078 INFO L87 Difference]: Start difference. First operand 210 states and 282 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 6 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 7 states have call predecessors, (26), 6 states have call successors, (26) [2024-11-23 23:13:42,159 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-23 23:13:46,511 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-23 23:13:50,891 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-23 23:14:03,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:14:03,158 INFO L93 Difference]: Finished difference Result 337 states and 465 transitions. [2024-11-23 23:14:03,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-23 23:14:03,159 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 6 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 7 states have call predecessors, (26), 6 states have call successors, (26) Word has length 210 [2024-11-23 23:14:03,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:14:03,163 INFO L225 Difference]: With dead ends: 337 [2024-11-23 23:14:03,163 INFO L226 Difference]: Without dead ends: 286 [2024-11-23 23:14:03,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-23 23:14:03,164 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 357 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 76 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.9s IncrementalHoareTripleChecker+Time [2024-11-23 23:14:03,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1599 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 960 Invalid, 3 Unknown, 0 Unchecked, 23.9s Time] [2024-11-23 23:14:03,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-23 23:14:03,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 236. [2024-11-23 23:14:03,196 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-23 23:14:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 323 transitions. [2024-11-23 23:14:03,200 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 323 transitions. Word has length 210 [2024-11-23 23:14:03,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:14:03,201 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 323 transitions. [2024-11-23 23:14:03,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 6 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 7 states have call predecessors, (26), 6 states have call successors, (26) [2024-11-23 23:14:03,201 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 323 transitions. [2024-11-23 23:14:03,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-23 23:14:03,205 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:14:03,205 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:14:03,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-23 23:14:03,206 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:14:03,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:14:03,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1947341260, now seen corresponding path program 1 times [2024-11-23 23:14:03,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:14:03,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132604668] [2024-11-23 23:14:03,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:14:03,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:14:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:14:09,753 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-23 23:14:09,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:14:09,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132604668] [2024-11-23 23:14:09,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132604668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:14:09,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:14:09,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 23:14:09,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143451564] [2024-11-23 23:14:09,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:14:09,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:14:09,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:14:09,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:14:09,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:14:09,756 INFO L87 Difference]: Start difference. First operand 236 states and 323 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-23 23:14:10,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:14:10,061 INFO L93 Difference]: Finished difference Result 285 states and 381 transitions. [2024-11-23 23:14:10,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:14:10,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) Word has length 216 [2024-11-23 23:14:10,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:14:10,065 INFO L225 Difference]: With dead ends: 285 [2024-11-23 23:14:10,066 INFO L226 Difference]: Without dead ends: 238 [2024-11-23 23:14:10,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:14:10,067 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 0 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:14:10,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1349 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 23:14:10,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-23 23:14:10,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-11-23 23:14:10,091 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-23 23:14:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 325 transitions. [2024-11-23 23:14:10,094 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 325 transitions. Word has length 216 [2024-11-23 23:14:10,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:14:10,095 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 325 transitions. [2024-11-23 23:14:10,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-23 23:14:10,096 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 325 transitions. [2024-11-23 23:14:10,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-23 23:14:10,099 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:14:10,099 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:14:10,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-23 23:14:10,099 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:14:10,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:14:10,100 INFO L85 PathProgramCache]: Analyzing trace with hash -561213031, now seen corresponding path program 1 times [2024-11-23 23:14:10,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:14:10,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710618939] [2024-11-23 23:14:10,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:14:10,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:14:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:14:32,625 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-23 23:14:32,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:14:32,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710618939] [2024-11-23 23:14:32,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710618939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:14:32,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531566378] [2024-11-23 23:14:32,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:14:32,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:14:32,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:14:32,630 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:14:32,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-23 23:14:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:14:42,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 5008 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-23 23:14:42,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:14:42,224 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-23 23:14:44,906 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_ensure_array_list_has_allocated_data_member_~list.offset_8 Int)) (and (= |c_#memory_$Pointer$#4.base| (store |c_old(#memory_$Pointer$#4.base)| |c_ensure_array_list_has_allocated_data_member_#in~list.base| (store (select |c_old(#memory_$Pointer$#4.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$#4.base| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_8)))) (<= v_ensure_array_list_has_allocated_data_member_~list.offset_8 |c_ensure_array_list_has_allocated_data_member_#in~list.offset|) (= (store |c_old(#memory_$Pointer$#4.offset)| |c_ensure_array_list_has_allocated_data_member_#in~list.base| (store (select |c_old(#memory_$Pointer$#4.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$#4.offset| |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$#4.offset|))) is different from true [2024-11-23 23:14:45,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:14:45,062 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-23 23:14:45,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:14:45,148 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-23 23:14:49,577 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$#4.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (= (select (select |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse1 (select |c_#memory_$Pointer$#4.offset| .cse1)) |c_#memory_$Pointer$#4.offset|) (not (= .cse1 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0))))))) is different from false [2024-11-23 23:14:49,598 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$#4.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (= (select (select |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse1 (select |c_#memory_$Pointer$#4.offset| .cse1)) |c_#memory_$Pointer$#4.offset|) (not (= .cse1 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0))))))) is different from true [2024-11-23 23:14:49,776 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$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse1 (select |c_#memory_$Pointer$#4.offset| .cse1)) |c_#memory_$Pointer$#4.offset|) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0))))) is different from false [2024-11-23 23:14:49,795 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$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse1 (select |c_#memory_$Pointer$#4.offset| .cse1)) |c_#memory_$Pointer$#4.offset|) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0))))) is different from true [2024-11-23 23:14:52,547 WARN L851 $PredicateComparison]: unable to prove that (and |c_aws_array_list_is_valid_#t~short139| (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse1 (select |c_#memory_$Pointer$#4.offset| .cse1)) |c_#memory_$Pointer$#4.offset|) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))))) is different from false [2024-11-23 23:14:52,573 WARN L873 $PredicateComparison]: unable to prove that (and |c_aws_array_list_is_valid_#t~short139| (or (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse1 (select |c_#memory_$Pointer$#4.offset| .cse1)) |c_#memory_$Pointer$#4.offset|) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))))) is different from true [2024-11-23 23:14:52,939 WARN L851 $PredicateComparison]: unable to prove that (and (or (= |c_aws_array_list_is_valid_#res| 1) (= |c_aws_array_list_is_valid_#res| 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 ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse1 (select |c_#memory_$Pointer$#4.offset| .cse1)) |c_#memory_$Pointer$#4.offset|) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))))) is different from false [2024-11-23 23:14:52,958 WARN L873 $PredicateComparison]: unable to prove that (and (or (= |c_aws_array_list_is_valid_#res| 1) (= |c_aws_array_list_is_valid_#res| 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 ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse1 (select |c_#memory_$Pointer$#4.offset| .cse1)) |c_#memory_$Pointer$#4.offset|) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))))) is different from true [2024-11-23 23:14:53,522 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$#4.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (= 0 |c_ULTIMATE.start_aws_array_list_copy_harness_#t~ret804#1|) (= 1 |c_ULTIMATE.start_aws_array_list_copy_harness_#t~ret804#1|)) (= (select (select |c_#memory_$Pointer$#4.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$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse2 (select |c_#memory_$Pointer$#4.offset| .cse2)) |c_#memory_$Pointer$#4.offset|) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0))))))) is different from false [2024-11-23 23:14:53,547 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$#4.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (or (= 0 |c_ULTIMATE.start_aws_array_list_copy_harness_#t~ret804#1|) (= 1 |c_ULTIMATE.start_aws_array_list_copy_harness_#t~ret804#1|)) (= (select (select |c_#memory_$Pointer$#4.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$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse2 (select |c_#memory_$Pointer$#4.offset| .cse2)) |c_#memory_$Pointer$#4.offset|) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0))))))) is different from true [2024-11-23 23:14:53,849 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$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.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$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse2 (select |c_#memory_$Pointer$#4.offset| .cse2)) |c_#memory_$Pointer$#4.offset|) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))))) is different from false [2024-11-23 23:14:53,872 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$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.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$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse2 (select |c_#memory_$Pointer$#4.offset| .cse2)) |c_#memory_$Pointer$#4.offset|) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))))) is different from true [2024-11-23 23:14:54,127 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$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.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$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse2 (select |c_#memory_$Pointer$#4.offset| .cse2)) |c_#memory_$Pointer$#4.offset|) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))))) is different from false [2024-11-23 23:14:54,146 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$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.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$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse2 (select |c_#memory_$Pointer$#4.offset| .cse2)) |c_#memory_$Pointer$#4.offset|) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))))) is different from true [2024-11-23 23:14:54,417 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$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.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$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse2 (select |c_#memory_$Pointer$#4.offset| .cse2)) |c_#memory_$Pointer$#4.offset|) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))))) is different from false [2024-11-23 23:14:54,435 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$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.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$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse1) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse2 (select |c_#memory_$Pointer$#4.offset| .cse2)) |c_#memory_$Pointer$#4.offset|) (not (= .cse2 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))))) is different from true [2024-11-23 23:14:55,074 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$#4.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (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 ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0)))) (= (select (select |c_#memory_$Pointer$#4.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 ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse3 (select |c_#memory_$Pointer$#4.offset| .cse3)) |c_#memory_$Pointer$#4.offset|) (not (= .cse3 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0))))))) is different from false [2024-11-23 23:14:55,093 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$#4.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0) (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 ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0)))) (= (select (select |c_#memory_$Pointer$#4.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 ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse3 (select |c_#memory_$Pointer$#4.offset| .cse3)) |c_#memory_$Pointer$#4.offset|) (not (= .cse3 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0))))))) is different from true [2024-11-23 23:14:55,642 WARN L851 $PredicateComparison]: unable to prove that (and (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 ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0)))) (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 ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .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$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse3 (select |c_#memory_$Pointer$#4.offset| .cse3)) |c_#memory_$Pointer$#4.offset|) (not (= .cse3 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))))) is different from false [2024-11-23 23:14:55,662 WARN L873 $PredicateComparison]: unable to prove that (and (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 ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0)))) (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 ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .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$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse3 (select |c_#memory_$Pointer$#4.offset| .cse3)) |c_#memory_$Pointer$#4.offset|) (not (= .cse3 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))))) is different from true [2024-11-23 23:14:56,761 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$#4.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .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$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse1) 0)))) (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 ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse2) 0)))) (= (select (select |c_#memory_$Pointer$#4.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 ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse4 (select |c_#memory_$Pointer$#4.offset| .cse4)) |c_#memory_$Pointer$#4.offset|) (not (= .cse4 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse5) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse5) 0))))))) is different from false [2024-11-23 23:14:56,781 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$#4.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .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$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse1) 0)))) (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 ((.cse2 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse2) 0)))) (= (select (select |c_#memory_$Pointer$#4.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 ((.cse3 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_9|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse3) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse4 (select |c_#memory_$Pointer$#4.offset| .cse4)) |c_#memory_$Pointer$#4.offset|) (not (= .cse4 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse5) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse5) 0))))))) is different from true [2024-11-23 23:14:58,478 INFO L349 Elim1Store]: treesize reduction 36, result has 70.2 percent of original size [2024-11-23 23:14:58,479 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-23 23:14:58,887 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 290 proven. 34 refuted. 2 times theorem prover too weak. 133 trivial. 55 not checked. [2024-11-23 23:14:58,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:15:17,310 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (forall ((v_ArrVal_23638 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0#1.base| v_ArrVal_23638) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_23639 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#to~0#1.base| v_ArrVal_23639) |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse0) 0)))) is different from false [2024-11-23 23:15:17,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531566378] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:15:17,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:15:17,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23] total 28 [2024-11-23 23:15:17,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9412901] [2024-11-23 23:15:17,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:15:17,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-23 23:15:17,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:15:17,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-23 23:15:17,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=387, Unknown=27, NotChecked=676, Total=1190 [2024-11-23 23:15:17,326 INFO L87 Difference]: Start difference. First operand 238 states and 325 transitions. Second operand has 28 states, 25 states have (on average 5.24) internal successors, (131), 23 states have internal predecessors, (131), 14 states have call successors, (55), 7 states have call predecessors, (55), 12 states have return successors, (56), 14 states have call predecessors, (56), 14 states have call successors, (56) [2024-11-23 23:15:27,185 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (.cse1 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (= (select .cse0 32) 0) (= (select .cse0 .cse1) 0) (= |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset| 0) (= (select .cse2 32) 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|)) (or (= (select .cse2 .cse1) 0) (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse3 (select |c_#memory_$Pointer$#4.offset| .cse3)) |c_#memory_$Pointer$#4.offset|) (not (= .cse3 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0))))))) is different from false [2024-11-23 23:15:27,202 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (.cse1 (+ 32 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset|))) (and (= (select .cse0 32) 0) (= (select .cse0 .cse1) 0) (= |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset| 0) (= (select .cse2 32) 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|)) (or (= (select .cse2 .cse1) 0) (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse3 (select |c_#memory_$Pointer$#4.offset| .cse3)) |c_#memory_$Pointer$#4.offset|) (not (= .cse3 |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base|) .cse1) 0))))))) is different from true [2024-11-23 23:15:27,222 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#4.offset)| |c_#memory_$Pointer$#4.offset|) (= |c_old(#memory_$Pointer$#4.base)| |c_#memory_$Pointer$#4.base|) (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$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse1 (select |c_#memory_$Pointer$#4.offset| .cse1)) |c_#memory_$Pointer$#4.offset|) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))))) is different from false [2024-11-23 23:15:27,239 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_old(#memory_$Pointer$#4.offset)| |c_#memory_$Pointer$#4.offset|) (= |c_old(#memory_$Pointer$#4.base)| |c_#memory_$Pointer$#4.base|) (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$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse0) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse1 (select |c_#memory_$Pointer$#4.offset| .cse1)) |c_#memory_$Pointer$#4.offset|) (not (= .cse1 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))))) is different from true [2024-11-23 23:15:27,312 WARN L851 $PredicateComparison]: unable to prove that (and (= c_assume_abort_if_not_~cond |c_assume_abort_if_not_#in~cond|) (exists ((|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0)))) (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 ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .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$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse3 (select |c_#memory_$Pointer$#4.offset| .cse3)) |c_#memory_$Pointer$#4.offset|) (not (= .cse3 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))))) is different from false [2024-11-23 23:15:27,337 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_11| Int) (|v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0)))) (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 ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .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$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse3 (select |c_#memory_$Pointer$#4.offset| .cse3)) |c_#memory_$Pointer$#4.offset|) (not (= .cse3 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))))) is different from true [2024-11-23 23:15:27,366 WARN L851 $PredicateComparison]: unable to prove that (and (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 ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0)))) (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 ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .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$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse3 (select |c_#memory_$Pointer$#4.offset| .cse3)) |c_#memory_$Pointer$#4.offset|) (not (= .cse3 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))))) is different from false [2024-11-23 23:15:27,391 WARN L873 $PredicateComparison]: unable to prove that (and (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 ((.cse0 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_11|))) (and (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_27|) .cse0) 0)))) (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 ((.cse1 (+ 32 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.offset_BEFORE_CALL_10|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .cse1) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_26|) .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$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse2) 0)))) (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 (exists ((|v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |c_#memory_$Pointer$#4.offset|))) (and (= (store |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| .cse3 (select |c_#memory_$Pointer$#4.offset| .cse3)) |c_#memory_$Pointer$#4.offset|) (not (= .cse3 |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|)) (= (select (select |v_old(#memory_$Pointer$#4.offset)_AFTER_CALL_12| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))) (= (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_array_list_copy_harness_~#from~0#1.base_BEFORE_CALL_25|) .cse4) 0)))))) is different from true [2024-11-23 23:15:39,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:15:39,122 INFO L93 Difference]: Finished difference Result 513 states and 674 transitions. [2024-11-23 23:15:39,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-23 23:15:39,124 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 5.24) internal successors, (131), 23 states have internal predecessors, (131), 14 states have call successors, (55), 7 states have call predecessors, (55), 12 states have return successors, (56), 14 states have call predecessors, (56), 14 states have call successors, (56) Word has length 226 [2024-11-23 23:15:39,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:15:39,128 INFO L225 Difference]: With dead ends: 513 [2024-11-23 23:15:39,128 INFO L226 Difference]: Without dead ends: 300 [2024-11-23 23:15:39,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 346 SyntacticMatches, 12 SemanticMatches, 46 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=196, Invalid=767, Unknown=35, NotChecked=1258, Total=2256 [2024-11-23 23:15:39,133 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 170 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 99 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 6841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 5277 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:15:39,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 745 Invalid, 6841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1462 Invalid, 3 Unknown, 5277 Unchecked, 18.5s Time] [2024-11-23 23:15:39,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-23 23:15:39,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 295. [2024-11-23 23:15:39,194 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-23 23:15:39,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 392 transitions. [2024-11-23 23:15:39,199 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 392 transitions. Word has length 226 [2024-11-23 23:15:39,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:15:39,199 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 392 transitions. [2024-11-23 23:15:39,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 5.24) internal successors, (131), 23 states have internal predecessors, (131), 14 states have call successors, (55), 7 states have call predecessors, (55), 12 states have return successors, (56), 14 states have call predecessors, (56), 14 states have call successors, (56) [2024-11-23 23:15:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 392 transitions. [2024-11-23 23:15:39,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-23 23:15:39,205 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:15:39,205 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:15:39,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-23 23:15:39,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-23 23:15:39,406 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:15:39,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:15:39,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1525028899, now seen corresponding path program 1 times [2024-11-23 23:15:39,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:15:39,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294307588] [2024-11-23 23:15:39,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:15:39,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:15:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:16:06,607 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 23 proven. 42 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-11-23 23:16:06,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:16:06,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294307588] [2024-11-23 23:16:06,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294307588] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:16:06,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448573595] [2024-11-23 23:16:06,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:16:06,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:16:06,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:16:06,611 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:16:06,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-23 23:16:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:16:15,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 5045 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-23 23:16:15,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:16:15,107 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-23 23:16:18,501 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_ensure_array_list_has_allocated_data_member_~list.offset_12 Int)) (and (= (store |c_old(#memory_$Pointer$#4.offset)| |c_ensure_array_list_has_allocated_data_member_#in~list.base| (store (select |c_old(#memory_$Pointer$#4.offset)| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_12 (select (select |c_#memory_$Pointer$#4.offset| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_12))) |c_#memory_$Pointer$#4.offset|) (<= v_ensure_array_list_has_allocated_data_member_~list.offset_12 |c_ensure_array_list_has_allocated_data_member_#in~list.offset|) (= |c_#memory_$Pointer$#4.base| (store |c_old(#memory_$Pointer$#4.base)| |c_ensure_array_list_has_allocated_data_member_#in~list.base| (store (select |c_old(#memory_$Pointer$#4.base)| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_12 (select (select |c_#memory_$Pointer$#4.base| |c_ensure_array_list_has_allocated_data_member_#in~list.base|) v_ensure_array_list_has_allocated_data_member_~list.offset_12)))))) is different from true [2024-11-23 23:16:18,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:16:18,611 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-23 23:16:18,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:16:18,669 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-23 23:16:26,078 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-23 23:16:26,099 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-23 23:16:26,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-23 23:16:26,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-23 23:16:30,290 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 293 proven. 50 refuted. 0 times theorem prover too weak. 162 trivial. 2 not checked. [2024-11-23 23:16:30,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:16:35,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448573595] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:16:35,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:16:35,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 30 [2024-11-23 23:16:35,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374702604] [2024-11-23 23:16:35,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:16:35,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-23 23:16:35,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:16:35,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-23 23:16:35,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=974, Unknown=11, NotChecked=64, Total=1190 [2024-11-23 23:16:35,696 INFO L87 Difference]: Start difference. First operand 295 states and 392 transitions. Second operand has 30 states, 27 states have (on average 5.074074074074074) internal successors, (137), 27 states have internal predecessors, (137), 16 states have call successors, (58), 4 states have call predecessors, (58), 11 states have return successors, (58), 15 states have call predecessors, (58), 16 states have call successors, (58) [2024-11-23 23:16:46,192 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-23 23:16:51,067 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-23 23:17:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:17:19,103 INFO L93 Difference]: Finished difference Result 513 states and 670 transitions. [2024-11-23 23:17:19,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-23 23:17:19,104 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 5.074074074074074) internal successors, (137), 27 states have internal predecessors, (137), 16 states have call successors, (58), 4 states have call predecessors, (58), 11 states have return successors, (58), 15 states have call predecessors, (58), 16 states have call successors, (58) Word has length 232 [2024-11-23 23:17:19,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:17:19,107 INFO L225 Difference]: With dead ends: 513 [2024-11-23 23:17:19,107 INFO L226 Difference]: Without dead ends: 257 [2024-11-23 23:17:19,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 352 SyntacticMatches, 16 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=279, Invalid=1875, Unknown=12, NotChecked=90, Total=2256 [2024-11-23 23:17:19,110 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 282 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 2876 mSolverCounterSat, 195 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 3430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 2876 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 354 IncrementalHoareTripleChecker+Unchecked, 39.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:17:19,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1075 Invalid, 3430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 2876 Invalid, 5 Unknown, 354 Unchecked, 39.0s Time] [2024-11-23 23:17:19,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-23 23:17:19,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 254. [2024-11-23 23:17:19,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 147 states have (on average 1.1496598639455782) internal successors, (169), 147 states have internal predecessors, (169), 84 states have call successors, (84), 21 states have call predecessors, (84), 22 states have return successors, (87), 85 states have call predecessors, (87), 83 states have call successors, (87) [2024-11-23 23:17:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 340 transitions. [2024-11-23 23:17:19,149 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 340 transitions. Word has length 232 [2024-11-23 23:17:19,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:17:19,149 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 340 transitions. [2024-11-23 23:17:19,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 5.074074074074074) internal successors, (137), 27 states have internal predecessors, (137), 16 states have call successors, (58), 4 states have call predecessors, (58), 11 states have return successors, (58), 15 states have call predecessors, (58), 16 states have call successors, (58) [2024-11-23 23:17:19,150 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 340 transitions. [2024-11-23 23:17:19,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-23 23:17:19,152 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:17:19,152 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:17:19,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-23 23:17:19,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:17:19,353 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:17:19,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:17:19,353 INFO L85 PathProgramCache]: Analyzing trace with hash -524063787, now seen corresponding path program 2 times [2024-11-23 23:17:19,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:17:19,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283292265] [2024-11-23 23:17:19,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:17:19,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:17:35,233 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 23:17:35,233 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:17:41,790 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2024-11-23 23:17:41,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:17:41,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283292265] [2024-11-23 23:17:41,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283292265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:17:41,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026622083] [2024-11-23 23:17:41,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:17:41,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:17:41,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:17:41,794 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:17:41,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_982580cd-30a3-4d49-afed-d87c121f45db/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process