./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7aeda8ef841ef7069da39f878404252c33796f5e53e1f416b530364b2ef30242 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:03:22,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:03:23,107 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-64bit-Taipan_Default.epf [2024-11-14 04:03:23,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:03:23,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:03:23,160 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:03:23,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:03:23,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:03:23,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:03:23,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:03:23,164 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:03:23,165 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:03:23,165 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:03:23,166 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:03:23,166 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:03:23,166 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:03:23,166 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:03:23,166 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:03:23,166 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:03:23,167 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:03:23,167 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:03:23,168 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:03:23,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:03:23,168 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:03:23,169 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:03:23,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:03:23,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:03:23,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:03:23,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:03:23,170 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:03:23,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:03:23,170 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:03:23,170 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:03:23,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:03:23,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:03:23,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:03:23,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:03:23,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:03:23,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:03:23,173 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:03:23,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:03:23,173 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:03:23,173 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:03:23,173 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:03:23,173 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E 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 -> Taipan 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 -> 7aeda8ef841ef7069da39f878404252c33796f5e53e1f416b530364b2ef30242 [2024-11-14 04:03:23,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:03:23,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:03:23,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:03:23,531 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:03:23,532 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:03:23,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i Unable to find full path for "g++" [2024-11-14 04:03:25,948 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:03:26,601 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:03:26,602 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i [2024-11-14 04:03:26,639 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/data/f59ab28de/17ba2fefdd974f1aa2d34961ddb6a074/FLAGb1c167056 [2024-11-14 04:03:26,660 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/data/f59ab28de/17ba2fefdd974f1aa2d34961ddb6a074 [2024-11-14 04:03:26,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:03:26,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:03:26,667 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:03:26,667 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:03:26,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:03:26,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:03:26" (1/1) ... [2024-11-14 04:03:26,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4426431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:26, skipping insertion in model container [2024-11-14 04:03:26,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:03:26" (1/1) ... [2024-11-14 04:03:26,775 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:03:27,146 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_0ccb862b-ff8d-478b-98d3-004632a91aad/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i[4496,4509] [2024-11-14 04:03:27,153 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_0ccb862b-ff8d-478b-98d3-004632a91aad/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i[4556,4569] [2024-11-14 04:03:28,235 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:28,236 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:28,237 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:28,238 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:28,240 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:28,262 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:28,264 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:28,266 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:28,268 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:28,271 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:28,273 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:28,274 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:28,274 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:29,143 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_0ccb862b-ff8d-478b-98d3-004632a91aad/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i[150476,150489] [2024-11-14 04:03:29,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:03:29,171 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:03:29,188 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_0ccb862b-ff8d-478b-98d3-004632a91aad/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i[4496,4509] [2024-11-14 04:03:29,189 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_0ccb862b-ff8d-478b-98d3-004632a91aad/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i[4556,4569] [2024-11-14 04:03:29,322 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:29,323 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:29,323 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:29,328 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:29,329 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:29,353 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:29,353 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:29,355 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:29,355 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:29,358 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:29,359 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:29,359 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:29,360 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:03:29,615 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_0ccb862b-ff8d-478b-98d3-004632a91aad/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i[150476,150489] [2024-11-14 04:03:29,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:03:29,861 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:03:29,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:29 WrapperNode [2024-11-14 04:03:29,862 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:03:29,863 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:03:29,863 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:03:29,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:03:29,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:29" (1/1) ... [2024-11-14 04:03:29,972 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:29" (1/1) ... [2024-11-14 04:03:30,034 INFO L138 Inliner]: procedures = 668, calls = 1039, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 141 [2024-11-14 04:03:30,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:03:30,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:03:30,036 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:03:30,036 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:03:30,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:29" (1/1) ... [2024-11-14 04:03:30,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:29" (1/1) ... [2024-11-14 04:03:30,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:29" (1/1) ... [2024-11-14 04:03:30,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:29" (1/1) ... [2024-11-14 04:03:30,064 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:29" (1/1) ... [2024-11-14 04:03:30,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:29" (1/1) ... [2024-11-14 04:03:30,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:29" (1/1) ... [2024-11-14 04:03:30,074 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:29" (1/1) ... [2024-11-14 04:03:30,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:03:30,080 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:03:30,080 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:03:30,080 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:03:30,085 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:29" (1/1) ... [2024-11-14 04:03:30,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:03:30,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:03:30,144 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:03:30,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:03:30,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 04:03:30,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-14 04:03:30,195 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-14 04:03:30,195 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-14 04:03:30,195 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-14 04:03:30,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 04:03:30,195 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-14 04:03:30,196 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-14 04:03:30,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:03:30,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 04:03:30,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:03:30,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:03:30,197 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 04:03:30,197 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 04:03:30,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 04:03:30,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 04:03:30,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 04:03:30,199 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-14 04:03:30,199 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-14 04:03:30,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:03:30,564 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:03:30,567 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:03:31,012 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-11-14 04:03:31,012 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:03:31,181 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:03:31,182 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-14 04:03:31,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:03:31 BoogieIcfgContainer [2024-11-14 04:03:31,183 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:03:31,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:03:31,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:03:31,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:03:31,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:03:26" (1/3) ... [2024-11-14 04:03:31,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610fc3a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:03:31, skipping insertion in model container [2024-11-14 04:03:31,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:29" (2/3) ... [2024-11-14 04:03:31,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610fc3a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:03:31, skipping insertion in model container [2024-11-14 04:03:31,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:03:31" (3/3) ... [2024-11-14 04:03:31,197 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rbegin_harness.i [2024-11-14 04:03:31,217 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:03:31,219 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_rbegin_harness.i that has 6 procedures, 46 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-14 04:03:31,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:03:31,324 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=FINITE_AUTOMATA, 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;@18f95bd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:03:31,326 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 04:03:31,334 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-14 04:03:31,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 04:03:31,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:03:31,345 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 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-14 04:03:31,345 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:03:31,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:03:31,355 INFO L85 PathProgramCache]: Analyzing trace with hash 896774759, now seen corresponding path program 1 times [2024-11-14 04:03:31,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:03:31,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307868503] [2024-11-14 04:03:31,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:03:31,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:03:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:03:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 04:03:33,051 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:03:33,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307868503] [2024-11-14 04:03:33,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307868503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:03:33,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058089168] [2024-11-14 04:03:33,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:03:33,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:03:33,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:03:33,059 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:03:33,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 04:03:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:03:33,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-14 04:03:33,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:03:33,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-14 04:03:33,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-14 04:03:33,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2024-11-14 04:03:33,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2024-11-14 04:03:37,345 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 04:03:37,346 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:03:37,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058089168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:03:37,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:03:37,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2024-11-14 04:03:37,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371059968] [2024-11-14 04:03:37,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:03:37,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 04:03:37,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:03:37,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 04:03:37,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-14 04:03:37,387 INFO L87 Difference]: Start difference. First operand has 46 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-14 04:03:38,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:03:38,356 INFO L93 Difference]: Finished difference Result 124 states and 173 transitions. [2024-11-14 04:03:38,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 04:03:38,359 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2024-11-14 04:03:38,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:03:38,368 INFO L225 Difference]: With dead ends: 124 [2024-11-14 04:03:38,368 INFO L226 Difference]: Without dead ends: 81 [2024-11-14 04:03:38,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-14 04:03:38,376 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 27 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:03:38,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 325 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 04:03:38,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-14 04:03:38,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2024-11-14 04:03:38,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 45 states have (on average 1.288888888888889) internal successors, (58), 47 states have internal predecessors, (58), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-14 04:03:38,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 104 transitions. [2024-11-14 04:03:38,437 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 104 transitions. Word has length 37 [2024-11-14 04:03:38,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:03:38,438 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 104 transitions. [2024-11-14 04:03:38,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-14 04:03:38,439 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2024-11-14 04:03:38,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-14 04:03:38,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:03:38,442 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 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-14 04:03:38,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-14 04:03:38,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-14 04:03:38,647 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:03:38,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:03:38,648 INFO L85 PathProgramCache]: Analyzing trace with hash -236580207, now seen corresponding path program 1 times [2024-11-14 04:03:38,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:03:38,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568791504] [2024-11-14 04:03:38,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:03:38,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:03:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:03:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 04:03:39,315 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:03:39,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568791504] [2024-11-14 04:03:39,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568791504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:03:39,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799121391] [2024-11-14 04:03:39,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:03:39,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:03:39,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:03:39,321 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:03:39,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 04:03:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:03:39,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-14 04:03:39,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:03:39,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-14 04:03:39,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-14 04:03:39,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2024-11-14 04:03:39,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:03:39,868 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 30 treesize of output 21 [2024-11-14 04:03:39,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2024-11-14 04:03:39,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:03:39,902 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 30 treesize of output 21 [2024-11-14 04:03:40,070 INFO L349 Elim1Store]: treesize reduction 96, result has 23.2 percent of original size [2024-11-14 04:03:40,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 108 treesize of output 75 [2024-11-14 04:03:40,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:03:40,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:03:40,102 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 44 treesize of output 37 [2024-11-14 04:03:40,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2024-11-14 04:03:43,266 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 04:03:43,266 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:03:46,106 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse10 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (or (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 0))) (or (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int)) (not (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_184))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_183))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int)) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse5) 0)) (let ((.cse7 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24))) (or (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int)) (not (= (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse7) 0))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int)) (not (= (select (select (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_184))) (store .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_183))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse7) 0))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int)) (= (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_184))) (store .cse9 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse9 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_183))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse10) 0)) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 Int)) (= (select (select (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_184))) (store .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_183))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse5) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int)) (= (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (store .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse10) 0)))) is different from false [2024-11-14 04:03:46,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:03:46,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 364 treesize of output 449 [2024-11-14 04:03:46,612 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:03:46,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2024-11-14 04:03:46,664 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:03:46,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2024-11-14 04:03:46,720 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:03:46,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2024-11-14 04:03:46,890 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:03:46,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2024-11-14 04:03:46,944 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:03:46,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2024-11-14 04:03:47,028 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:03:47,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2024-11-14 04:03:47,094 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:03:47,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 24 [2024-11-14 04:03:47,352 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:03:47,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 24 [2024-11-14 04:03:47,382 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:03:47,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 24 [2024-11-14 04:03:47,408 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:03:47,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 24 [2024-11-14 04:03:47,435 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:03:47,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 24 [2024-11-14 04:03:47,787 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 04:03:47,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 4 [2024-11-14 04:03:47,927 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 20 treesize of output 18 [2024-11-14 04:03:47,934 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 20 treesize of output 18 [2024-11-14 04:03:48,008 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 20 treesize of output 18 [2024-11-14 04:03:50,298 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) (.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| 0))) (.cse2 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse4 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 0) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_22 Int) (v_subst_4 Int) (v_DerPreprocessor_5 Int) (v_subst_3 Int) (v_subst_2 Int)) (let ((.cse0 (store (store (store v_arrayElimArr_6 v_subst_2 v_DerPreprocessor_22) v_subst_4 v_DerPreprocessor_5) v_subst_3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (or (not (= .cse0 (store (store v_arrayElimArr_6 v_subst_2 (select .cse0 v_subst_2)) v_subst_3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (= (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_6))) (store .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse4) 0) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_6 v_subst_2))) (= v_subst_4 v_subst_2) (not (= (select .cse0 v_subst_4) v_DerPreprocessor_5))))))) (or (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_16 Int) (v_subst_4 Int) (v_subst_3 Int)) (or (= (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_6))) (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse4) 0) (not (= (select (store (store v_arrayElimArr_6 v_subst_4 v_DerPreprocessor_16) v_subst_3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_4) v_DerPreprocessor_16)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_6 v_subst_4))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_subst_4 Int)) (or (= (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_6))) (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse4) 0) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_6 v_subst_4))))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 0) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_subst_4 Int) (v_subst_1 Int) (v_DerPreprocessor_1 Int)) (or (= (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_6))) (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse4) 0) (not (= v_DerPreprocessor_1 (select (store (store v_arrayElimArr_6 v_subst_4 v_DerPreprocessor_1) v_subst_1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_4))) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_6 v_subst_4))))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_DerPreprocessor_25 Int) (v_DerPreprocessor_18 Int) (v_subst_4 Int) (v_subst_3 Int) (v_subst_1 Int)) (let ((.cse9 (store v_arrayElimArr_5 v_subst_1 v_DerPreprocessor_25)) (.cse8 (store (store v_arrayElimArr_5 v_subst_1 v_DerPreprocessor_18) v_subst_3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (or (not (= .cse8 (store (store .cse9 v_subst_4 (select .cse8 v_subst_4)) v_subst_3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (not (= (select (store .cse9 v_subst_4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_1) v_DerPreprocessor_25)) (not (= (select .cse8 v_subst_1) v_DerPreprocessor_18)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_5 v_subst_1))) (= (select (select (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_5))) (store .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse11) 0)))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)) (forall ((v_ArrVal_184 (Array Int Int))) (= (select (select (store .cse12 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_ArrVal_184) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse11) 0)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_subst_3 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_4 v_subst_3))) (not (= (select (select (let ((.cse13 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_4))) (store .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 0) (forall ((v_prenex_3 (Array Int Int))) (not (= (select (select (store .cse12 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_prenex_3) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)) (forall ((v_prenex_1 (Array Int Int))) (= (select (select (store .cse12 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_prenex_1) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse4) 0)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (let ((.cse14 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24))) (or (forall ((v_prenex_5 (Array Int Int))) (not (= (select (select (store .cse12 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_prenex_5) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse14) 0))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 0) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_subst_4 Int) (v_subst_3 Int) (v_DerPreprocessor_20 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_3 v_subst_4))) (not (= (select (select (let ((.cse15 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_3))) (store .cse15 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse15 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse14) 0)) (not (= v_DerPreprocessor_20 (select (store (store v_arrayElimArr_3 v_subst_4 v_DerPreprocessor_20) v_subst_3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_4)))))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_28 Int) (v_subst_4 Int) (v_subst_3 Int) (v_subst_1 Int)) (let ((.cse16 (store (store v_arrayElimArr_6 v_subst_1 v_DerPreprocessor_11) v_subst_3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (.cse18 (store v_arrayElimArr_6 v_subst_1 v_DerPreprocessor_28))) (or (not (= (select v_arrayElimArr_6 v_subst_1) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (not (= (select .cse16 v_subst_1) v_DerPreprocessor_11)) (= (select (select (let ((.cse17 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_6))) (store .cse17 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse17 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse4) 0) (not (= (store (store .cse18 v_subst_4 (select .cse16 v_subst_4)) v_subst_3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse16)) (not (= v_DerPreprocessor_28 (select (store .cse18 v_subst_4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_1)))))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 0))))) is different from false [2024-11-14 04:03:50,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:03:50,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 41 [2024-11-14 04:03:50,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:03:50,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 69 [2024-11-14 04:03:50,617 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 11 treesize of output 7 [2024-11-14 04:03:50,687 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:50,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:03:50,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:03:50,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 46 [2024-11-14 04:03:50,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 70 [2024-11-14 04:03:50,744 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:51,368 INFO L349 Elim1Store]: treesize reduction 466, result has 23.5 percent of original size [2024-11-14 04:03:51,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 26 case distinctions, treesize of input 154 treesize of output 342 [2024-11-14 04:03:51,449 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:51,510 INFO L349 Elim1Store]: treesize reduction 16, result has 44.8 percent of original size [2024-11-14 04:03:51,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 44 [2024-11-14 04:03:51,929 INFO L349 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2024-11-14 04:03:51,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 78 treesize of output 67 [2024-11-14 04:03:51,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:03:51,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 153 [2024-11-14 04:03:52,101 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:52,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:03:52,128 INFO L349 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2024-11-14 04:03:52,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 37 [2024-11-14 04:03:52,162 INFO L349 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2024-11-14 04:03:52,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 36 [2024-11-14 04:03:52,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 80 [2024-11-14 04:03:52,187 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:52,189 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:52,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 67 [2024-11-14 04:03:52,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:03:52,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 63 [2024-11-14 04:03:52,232 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:52,238 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:52,240 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:52,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-14 04:03:52,264 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:52,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:03:52,271 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:52,272 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:52,280 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:03:52,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-14 04:03:52,294 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:52,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:03:52,301 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:52,302 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:52,308 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:03:52,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-14 04:03:52,314 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:52,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:03:52,321 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:52,321 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:52,327 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:03:52,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-14 04:03:52,335 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:52,336 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:52,342 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:03:52,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 1 [2024-11-14 04:03:52,349 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:52,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:03:52,355 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:52,356 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:52,363 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:03:52,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-14 04:03:52,369 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:52,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:03:52,375 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:52,376 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:03:52,382 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:03:52,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-14 04:03:52,392 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:03:52,522 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 1 not checked. [2024-11-14 04:03:52,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799121391] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:03:52,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [690141154] [2024-11-14 04:03:52,548 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-14 04:03:52,548 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:03:52,553 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:03:52,559 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:03:52,559 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:03:55,134 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 98 for LOIs [2024-11-14 04:03:55,263 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 6 for LOIs [2024-11-14 04:03:55,265 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 95 for LOIs [2024-11-14 04:03:55,283 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:04:04,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [690141154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:04:04,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:04:04,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5, 10, 9] total 30 [2024-11-14 04:04:04,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653613255] [2024-11-14 04:04:04,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:04:04,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 04:04:04,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:04:04,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 04:04:04,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=671, Unknown=4, NotChecked=106, Total=870 [2024-11-14 04:04:04,145 INFO L87 Difference]: Start difference. First operand 79 states and 104 transitions. Second operand has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-14 04:04:07,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:09,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:11,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:13,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:15,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:17,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:19,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:24,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:26,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:28,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:30,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:32,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:34,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:36,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:39,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:41,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:43,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:45,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:47,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:49,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:51,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:54,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:56,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:58,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:00,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:02,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:04,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:07,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:09,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:11,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:13,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:15,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:17,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:20,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:22,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:24,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:26,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:28,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:30,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:32,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:35,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:37,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:39,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:41,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:43,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:45,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:47,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:50,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:52,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:54,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:56,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:58,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:06:00,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:06:02,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:06:04,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:06:07,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:06:09,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:06:11,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:06:11,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:06:11,432 INFO L93 Difference]: Finished difference Result 142 states and 187 transitions. [2024-11-14 04:06:11,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 04:06:11,736 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 38 [2024-11-14 04:06:11,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:06:11,740 INFO L225 Difference]: With dead ends: 142 [2024-11-14 04:06:11,740 INFO L226 Difference]: Without dead ends: 107 [2024-11-14 04:06:11,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 79 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=116, Invalid=879, Unknown=5, NotChecked=122, Total=1122 [2024-11-14 04:06:11,742 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 21 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 5 mSolverCounterUnsat, 58 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 117.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 58 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 124.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:06:11,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 255 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 263 Invalid, 58 Unknown, 0 Unchecked, 124.0s Time] [2024-11-14 04:06:11,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-14 04:06:11,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2024-11-14 04:06:11,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 68 states have internal predecessors, (87), 26 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2024-11-14 04:06:11,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 138 transitions. [2024-11-14 04:06:11,791 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 138 transitions. Word has length 38 [2024-11-14 04:06:11,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:06:11,795 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 138 transitions. [2024-11-14 04:06:11,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-14 04:06:11,795 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 138 transitions. [2024-11-14 04:06:11,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-14 04:06:11,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:06:11,798 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-14 04:06:11,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 04:06:11,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-14 04:06:11,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:06:11,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:06:11,999 INFO L85 PathProgramCache]: Analyzing trace with hash -501521555, now seen corresponding path program 1 times [2024-11-14 04:06:11,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:06:11,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579180925] [2024-11-14 04:06:11,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:06:11,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:06:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:06:12,286 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 04:06:12,286 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:06:12,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579180925] [2024-11-14 04:06:12,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579180925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:06:12,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597600814] [2024-11-14 04:06:12,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:06:12,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:06:12,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:06:12,289 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:06:12,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 04:06:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:06:12,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 04:06:12,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:06:12,606 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 04:06:12,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:06:12,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597600814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:06:12,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:06:12,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-11-14 04:06:12,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648247329] [2024-11-14 04:06:12,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:06:12,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:06:12,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:06:12,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:06:12,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-14 04:06:12,608 INFO L87 Difference]: Start difference. First operand 105 states and 138 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-14 04:06:12,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:06:12,817 INFO L93 Difference]: Finished difference Result 219 states and 286 transitions. [2024-11-14 04:06:12,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:06:12,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 40 [2024-11-14 04:06:12,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:06:12,820 INFO L225 Difference]: With dead ends: 219 [2024-11-14 04:06:12,820 INFO L226 Difference]: Without dead ends: 121 [2024-11-14 04:06:12,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-14 04:06:12,822 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:06:12,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 172 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:06:12,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-14 04:06:12,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 105. [2024-11-14 04:06:12,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 68 states have internal predecessors, (85), 26 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2024-11-14 04:06:12,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2024-11-14 04:06:12,866 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 40 [2024-11-14 04:06:12,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:06:12,866 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 136 transitions. [2024-11-14 04:06:12,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-14 04:06:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 136 transitions. [2024-11-14 04:06:12,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-14 04:06:12,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:06:12,868 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-14 04:06:12,892 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 04:06:13,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:06:13,069 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:06:13,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:06:13,069 INFO L85 PathProgramCache]: Analyzing trace with hash -475820718, now seen corresponding path program 1 times [2024-11-14 04:06:13,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:06:13,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453619665] [2024-11-14 04:06:13,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:06:13,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:06:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:06:13,408 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 04:06:13,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:06:13,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453619665] [2024-11-14 04:06:13,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453619665] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:06:13,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127753061] [2024-11-14 04:06:13,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:06:13,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:06:13,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:06:13,412 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:06:13,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 04:06:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:06:13,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 04:06:13,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:06:13,774 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 04:06:13,774 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:06:13,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127753061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:06:13,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:06:13,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2024-11-14 04:06:13,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095640904] [2024-11-14 04:06:13,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:06:13,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 04:06:13,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:06:13,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 04:06:13,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-14 04:06:13,777 INFO L87 Difference]: Start difference. First operand 105 states and 136 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-14 04:06:14,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:06:14,026 INFO L93 Difference]: Finished difference Result 245 states and 324 transitions. [2024-11-14 04:06:14,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 04:06:14,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 42 [2024-11-14 04:06:14,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:06:14,029 INFO L225 Difference]: With dead ends: 245 [2024-11-14 04:06:14,029 INFO L226 Difference]: Without dead ends: 145 [2024-11-14 04:06:14,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-14 04:06:14,031 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 23 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:06:14,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 199 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:06:14,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-14 04:06:14,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 107. [2024-11-14 04:06:14,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 70 states have internal predecessors, (87), 26 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2024-11-14 04:06:14,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 138 transitions. [2024-11-14 04:06:14,097 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 138 transitions. Word has length 42 [2024-11-14 04:06:14,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:06:14,097 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 138 transitions. [2024-11-14 04:06:14,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-14 04:06:14,098 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 138 transitions. [2024-11-14 04:06:14,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-14 04:06:14,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:06:14,099 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-14 04:06:14,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 04:06:14,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:06:14,300 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:06:14,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:06:14,300 INFO L85 PathProgramCache]: Analyzing trace with hash 14189440, now seen corresponding path program 1 times [2024-11-14 04:06:14,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:06:14,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366060155] [2024-11-14 04:06:14,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:06:14,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:06:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:06:14,705 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 04:06:14,706 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:06:14,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366060155] [2024-11-14 04:06:14,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366060155] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:06:14,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365967586] [2024-11-14 04:06:14,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:06:14,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:06:14,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:06:14,710 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:06:14,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 04:06:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:06:14,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 04:06:14,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:06:14,995 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-14 04:06:14,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:06:14,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365967586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:06:14,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:06:14,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-14 04:06:14,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985907200] [2024-11-14 04:06:14,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:06:14,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:06:14,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:06:14,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:06:14,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:06:14,998 INFO L87 Difference]: Start difference. First operand 107 states and 138 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-14 04:06:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:06:15,095 INFO L93 Difference]: Finished difference Result 219 states and 299 transitions. [2024-11-14 04:06:15,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:06:15,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2024-11-14 04:06:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:06:15,098 INFO L225 Difference]: With dead ends: 219 [2024-11-14 04:06:15,098 INFO L226 Difference]: Without dead ends: 125 [2024-11-14 04:06:15,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:06:15,100 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:06:15,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 87 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:06:15,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-14 04:06:15,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 113. [2024-11-14 04:06:15,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 76 states have internal predecessors, (95), 26 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2024-11-14 04:06:15,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2024-11-14 04:06:15,135 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 43 [2024-11-14 04:06:15,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:06:15,136 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2024-11-14 04:06:15,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-14 04:06:15,136 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2024-11-14 04:06:15,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-14 04:06:15,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:06:15,138 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-14 04:06:15,162 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 04:06:15,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:06:15,339 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:06:15,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:06:15,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2144969107, now seen corresponding path program 1 times [2024-11-14 04:06:15,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:06:15,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545033618] [2024-11-14 04:06:15,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:06:15,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:06:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:06:15,772 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 04:06:15,773 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:06:15,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545033618] [2024-11-14 04:06:15,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545033618] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:06:15,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99217922] [2024-11-14 04:06:15,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:06:15,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:06:15,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:06:15,776 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:06:15,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 04:06:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:06:16,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 109 conjuncts are in the unsatisfiable core [2024-11-14 04:06:16,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:06:16,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-14 04:06:16,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-14 04:06:16,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:06:16,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:06:16,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2024-11-14 04:06:16,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:06:16,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:06:16,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2024-11-14 04:06:16,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:06:16,351 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 30 treesize of output 21 [2024-11-14 04:06:16,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:06:16,364 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 30 treesize of output 21 [2024-11-14 04:06:16,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:06:16,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:06:16,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:06:16,553 INFO L349 Elim1Store]: treesize reduction 96, result has 23.2 percent of original size [2024-11-14 04:06:16,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 108 treesize of output 75 [2024-11-14 04:06:16,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:06:16,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:06:16,572 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 44 treesize of output 37 [2024-11-14 04:06:16,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:06:16,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:06:16,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:06:16,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2024-11-14 04:06:21,425 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 04:06:21,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:06:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 04:06:26,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99217922] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:06:26,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1904697773] [2024-11-14 04:06:26,436 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2024-11-14 04:06:26,436 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:06:26,436 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:06:26,437 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:06:26,437 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:06:28,011 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 98 for LOIs [2024-11-14 04:06:28,098 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 17 for LOIs [2024-11-14 04:06:28,102 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 95 for LOIs [2024-11-14 04:06:28,120 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 8 for LOIs [2024-11-14 04:06:28,142 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:06:37,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1904697773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:06:37,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:06:37,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [5, 17, 10] total 42 [2024-11-14 04:06:37,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225872291] [2024-11-14 04:06:37,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:06:37,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 04:06:37,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:06:37,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 04:06:37,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1592, Unknown=2, NotChecked=0, Total=1722 [2024-11-14 04:06:37,827 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand has 16 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-14 04:06:41,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:06:43,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:06:45,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:06:47,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:06:49,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:06:51,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:06:56,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:00,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:03,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:05,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:07,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:09,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:11,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:13,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:18,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:22,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:25,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:27,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:29,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:31,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:33,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:35,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:37,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:40,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:42,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:44,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:46,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:48,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:50,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:52,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:54,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:57,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:59,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:01,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:05,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:07,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:10,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:12,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:14,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:16,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:18,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:21,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:23,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:25,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:27,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:29,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:31,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:33,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:36,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:38,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:40,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:42,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:44,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:46,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:49,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:51,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:53,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:55,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:57,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:08:59,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:09:01,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:09:03,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:09:06,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:09:08,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:09:10,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:09:12,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:09:12,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:09:12,802 INFO L93 Difference]: Finished difference Result 245 states and 321 transitions. [2024-11-14 04:09:13,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 04:09:13,140 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 46 [2024-11-14 04:09:13,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:09:13,142 INFO L225 Difference]: With dead ends: 245 [2024-11-14 04:09:13,142 INFO L226 Difference]: Without dead ends: 145 [2024-11-14 04:09:13,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 96 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=194, Invalid=2349, Unknown=7, NotChecked=0, Total=2550 [2024-11-14 04:09:13,145 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 39 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 10 mSolverCounterUnsat, 67 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 134.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 67 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 141.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:09:13,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 256 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 380 Invalid, 67 Unknown, 0 Unchecked, 141.8s Time] [2024-11-14 04:09:13,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-14 04:09:13,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 117. [2024-11-14 04:09:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 76 states have (on average 1.263157894736842) internal successors, (96), 80 states have internal predecessors, (96), 26 states have call successors, (26), 12 states have call predecessors, (26), 14 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2024-11-14 04:09:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 148 transitions. [2024-11-14 04:09:13,194 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 148 transitions. Word has length 46 [2024-11-14 04:09:13,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:09:13,194 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 148 transitions. [2024-11-14 04:09:13,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-14 04:09:13,194 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2024-11-14 04:09:13,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-14 04:09:13,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:09:13,196 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-14 04:09:13,217 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-14 04:09:13,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-14 04:09:13,397 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:09:13,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:09:13,398 INFO L85 PathProgramCache]: Analyzing trace with hash 719046738, now seen corresponding path program 1 times [2024-11-14 04:09:13,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:09:13,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063712556] [2024-11-14 04:09:13,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:09:13,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:09:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:09:14,488 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 04:09:14,489 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:09:14,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063712556] [2024-11-14 04:09:14,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063712556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:09:14,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875239033] [2024-11-14 04:09:14,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:09:14,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:09:14,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:09:14,492 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:09:14,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 04:09:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:09:14,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-14 04:09:14,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:09:14,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-14 04:09:14,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-14 04:09:15,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2024-11-14 04:09:15,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:09:15,104 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 30 treesize of output 21 [2024-11-14 04:09:15,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2024-11-14 04:09:15,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:09:15,134 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 30 treesize of output 21 [2024-11-14 04:09:15,299 INFO L349 Elim1Store]: treesize reduction 96, result has 23.2 percent of original size [2024-11-14 04:09:15,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 108 treesize of output 75 [2024-11-14 04:09:15,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:09:15,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:09:15,324 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 44 treesize of output 37 [2024-11-14 04:09:15,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2024-11-14 04:09:18,462 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 04:09:18,462 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:09:21,077 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse11 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (or (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 0))) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse3) 0)) (or (forall ((v_ArrVal_707 (Array Int Int)) (v_ArrVal_705 Int)) (not (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_707))) (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_705))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0))) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int)) (not (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)))) (let ((.cse7 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24))) (or (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int)) (not (= (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse7) 0))) (forall ((v_ArrVal_707 (Array Int Int)) (v_ArrVal_705 Int)) (not (= (select (select (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_707))) (store .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_705))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse7) 0))))) (forall ((v_ArrVal_707 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_707))) (store .cse9 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse9 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_705))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse3) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int)) (= (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (store .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse11) 0)) (forall ((v_ArrVal_707 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_707))) (store .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_705))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse11) 0)))) is different from false [2024-11-14 04:09:21,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:09:21,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 364 treesize of output 449 [2024-11-14 04:09:22,008 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:09:22,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2024-11-14 04:09:22,082 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:09:22,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 24 [2024-11-14 04:09:22,141 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:09:22,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 24 [2024-11-14 04:09:22,168 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:09:22,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 24 [2024-11-14 04:09:22,201 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:09:22,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 24 [2024-11-14 04:09:22,297 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:09:22,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 24 [2024-11-14 04:09:22,545 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 20 treesize of output 18 [2024-11-14 04:09:22,633 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 04:09:22,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 4 [2024-11-14 04:09:22,710 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 20 treesize of output 18 [2024-11-14 04:09:22,720 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 20 treesize of output 18 [2024-11-14 04:09:22,946 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) (.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| 0))) (.cse5 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 0) (forall ((v_prenex_34 (Array Int Int))) (= (select (select (store .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| v_prenex_34) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse1) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 1)))) (or (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 1)) (forall ((v_prenex_30 (Array Int Int))) (= (select (select (store .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| v_prenex_30) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| Int)) (let ((.cse3 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 1)) (forall ((v_prenex_32 (Array Int Int))) (not (= (select (select (store .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| v_prenex_32) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse3) 0))) (forall ((v_arrayElimArr_28 (Array Int Int)) (v_subst_8 Int)) (or (not (= (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| v_arrayElimArr_28))) (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse3) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_28 v_subst_8)))))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| Int)) (or (forall ((v_DerPreprocessor_56 Int) (v_arrayElimArr_26 (Array Int Int)) (v_subst_8 Int) (v_subst_7 Int) (v_subst_6 Int) (v_DerPreprocessor_60 Int)) (let ((.cse7 (store v_arrayElimArr_26 v_subst_6 v_DerPreprocessor_60))) (let ((.cse8 (store (store .cse7 v_subst_7 v_DerPreprocessor_56) v_subst_8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (or (not (= v_DerPreprocessor_60 (select (store .cse7 v_subst_7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_6))) (not (= v_DerPreprocessor_56 (select .cse8 v_subst_7))) (= (select (select (let ((.cse9 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| v_arrayElimArr_26))) (store .cse9 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse9 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse1) 0) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_26 v_subst_6))) (not (= .cse8 (store (store v_arrayElimArr_26 v_subst_6 (select .cse8 v_subst_6)) v_subst_8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))))))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 1)) (forall ((v_subst_7 Int) (v_arrayElimArr_27 (Array Int Int))) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_27 v_subst_7))) (forall ((v_subst_8 Int) (v_DerPreprocessor_50 Int)) (not (= v_DerPreprocessor_50 (select (store (store v_arrayElimArr_27 v_subst_7 v_DerPreprocessor_50) v_subst_8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_7)))) (= (select (select (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| v_arrayElimArr_27))) (store .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 0) (forall ((v_ArrVal_707 (Array Int Int))) (not (= (select (select (store .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| v_ArrVal_707) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0))) (forall ((v_DerPreprocessor_58 Int) (v_arrayElimArr_25 (Array Int Int)) (v_subst_8 Int) (v_subst_7 Int) (v_subst_5 Int) (v_DerPreprocessor_54 Int)) (let ((.cse13 (store v_arrayElimArr_25 v_subst_5 v_DerPreprocessor_58))) (let ((.cse12 (store (store .cse13 v_subst_7 v_DerPreprocessor_54) v_subst_8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (or (not (= (select (select (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| v_arrayElimArr_25))) (store .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_25 v_subst_5))) (not (= .cse12 (store (store v_arrayElimArr_25 v_subst_5 (select .cse12 v_subst_5)) v_subst_8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (not (= v_DerPreprocessor_54 (select .cse12 v_subst_7))) (not (= v_DerPreprocessor_58 (select (store .cse13 v_subst_7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_5))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 1)))))) is different from false [2024-11-14 04:09:23,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:09:23,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 41 [2024-11-14 04:09:23,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:09:23,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 69 [2024-11-14 04:09:23,182 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 11 treesize of output 7 [2024-11-14 04:09:23,254 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:09:23,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:09:23,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:09:23,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 47 [2024-11-14 04:09:23,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:09:23,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 46 [2024-11-14 04:09:23,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 88 [2024-11-14 04:09:23,314 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:09:23,321 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-14 04:09:23,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 71 [2024-11-14 04:09:23,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:09:23,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2024-11-14 04:09:23,347 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:09:23,351 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:09:23,359 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-14 04:09:23,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 17 [2024-11-14 04:09:23,384 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:09:23,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:09:23,389 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:09:23,390 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:09:23,395 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:09:23,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-14 04:09:23,405 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:09:23,412 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:09:23,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:09:23,419 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:09:23,420 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:09:23,426 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:09:23,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-14 04:09:23,433 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:09:23,433 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:09:23,437 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:09:23,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 1 [2024-11-14 04:09:23,564 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 1 not checked. [2024-11-14 04:09:23,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875239033] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:09:23,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1495810794] [2024-11-14 04:09:23,568 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2024-11-14 04:09:23,568 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:09:23,568 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:09:23,568 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:09:23,569 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:09:24,930 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 98 for LOIs [2024-11-14 04:09:25,041 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 17 for LOIs [2024-11-14 04:09:25,045 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 95 for LOIs [2024-11-14 04:09:25,063 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 1 for LOIs [2024-11-14 04:09:25,080 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:09:30,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1495810794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:09:30,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:09:30,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [8, 10, 9] total 37 [2024-11-14 04:09:30,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016214139] [2024-11-14 04:09:30,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:09:30,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 04:09:30,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:09:30,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 04:09:30,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1081, Unknown=3, NotChecked=134, Total=1332 [2024-11-14 04:09:30,779 INFO L87 Difference]: Start difference. First operand 117 states and 148 transitions. Second operand has 15 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-14 04:09:34,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:09:36,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:09:38,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:09:40,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:09:42,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:09:45,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:09:47,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:09:49,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:09:51,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:09:53,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:09:56,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:09:58,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:00,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:02,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:05,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:07,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:09,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:12,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:14,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:16,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:18,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:20,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:23,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:25,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:27,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:29,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:31,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:33,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:36,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:38,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:40,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:42,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:44,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:46,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:49,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:51,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:53,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:55,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:57,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:10:59,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:11:02,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:11:04,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:11:06,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:11:08,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:11:10,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:11:12,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:11:14,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:11:17,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:11:19,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:11:21,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:11:23,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:11:23,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:11:23,992 INFO L93 Difference]: Finished difference Result 239 states and 301 transitions. [2024-11-14 04:11:24,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-14 04:11:24,365 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 48 [2024-11-14 04:11:24,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:11:24,366 INFO L225 Difference]: With dead ends: 239 [2024-11-14 04:11:24,366 INFO L226 Difference]: Without dead ends: 135 [2024-11-14 04:11:24,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 105 SyntacticMatches, 10 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=174, Invalid=1723, Unknown=3, NotChecked=170, Total=2070 [2024-11-14 04:11:24,368 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 31 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 12 mSolverCounterUnsat, 51 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 104.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 51 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 111.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:11:24,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 239 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 376 Invalid, 51 Unknown, 0 Unchecked, 111.3s Time] [2024-11-14 04:11:24,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-14 04:11:24,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 119. [2024-11-14 04:11:24,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 82 states have internal predecessors, (98), 26 states have call successors, (26), 12 states have call predecessors, (26), 14 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2024-11-14 04:11:24,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 150 transitions. [2024-11-14 04:11:24,419 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 150 transitions. Word has length 48 [2024-11-14 04:11:24,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:11:24,419 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 150 transitions. [2024-11-14 04:11:24,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-14 04:11:24,420 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 150 transitions. [2024-11-14 04:11:24,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-14 04:11:24,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:11:24,421 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-14 04:11:24,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-14 04:11:24,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-14 04:11:24,626 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:11:24,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:11:24,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1599625088, now seen corresponding path program 1 times [2024-11-14 04:11:24,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:11:24,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123647851] [2024-11-14 04:11:24,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:11:24,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:11:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:11:25,850 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 04:11:25,850 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:11:25,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123647851] [2024-11-14 04:11:25,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123647851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:11:25,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308430188] [2024-11-14 04:11:25,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:11:25,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:11:25,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:11:25,854 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:11:25,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 04:11:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:11:26,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-14 04:11:26,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:11:26,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-14 04:11:26,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-14 04:11:26,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:11:26,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:11:26,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2024-11-14 04:11:26,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:11:26,498 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 34 treesize of output 25 [2024-11-14 04:11:26,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:11:26,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:11:26,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2024-11-14 04:11:26,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:11:26,527 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 34 treesize of output 25 [2024-11-14 04:11:26,728 INFO L349 Elim1Store]: treesize reduction 112, result has 22.8 percent of original size [2024-11-14 04:11:26,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 118 treesize of output 85 [2024-11-14 04:11:26,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:11:26,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:11:26,752 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 54 treesize of output 47 [2024-11-14 04:11:26,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2024-11-14 04:11:30,497 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:11:30,497 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:11:33,563 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse11 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (or (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 0))) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_817 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_820))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_817))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int)) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (let ((.cse6 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24))) (or (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int)) (not (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse6) 0))) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_817 Int)) (not (= (select (select (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_820))) (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_817))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse6) 0))))) (or (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_817 Int)) (not (= 0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_820))) (store .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_817))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)))) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int)) (not (= (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (store .cse9 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse9 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)))) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_817 Int)) (= (select (select (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_820))) (store .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_817))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse11) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int)) (= (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (store .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse11) 0)))) is different from false [2024-11-14 04:11:34,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:11:34,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 364 treesize of output 449 [2024-11-14 04:11:34,310 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:11:34,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2024-11-14 04:11:34,363 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:11:34,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2024-11-14 04:11:34,412 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:11:34,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2024-11-14 04:11:34,493 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:11:34,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2024-11-14 04:11:34,566 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:11:34,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2024-11-14 04:11:34,617 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:11:34,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2024-11-14 04:11:34,655 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:11:34,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 24 [2024-11-14 04:11:34,715 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:11:34,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 24 [2024-11-14 04:11:34,736 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:11:34,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 24 [2024-11-14 04:11:34,985 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:11:34,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 24 [2024-11-14 04:11:35,010 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:11:35,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 24 [2024-11-14 04:11:35,030 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 04:11:35,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 4 [2024-11-14 04:11:35,056 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 04:11:35,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 4 [2024-11-14 04:11:35,133 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 04:11:35,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 4 [2024-11-14 04:11:35,144 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 04:11:35,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 4 [2024-11-14 04:11:35,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 4 [2024-11-14 04:11:35,458 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 04:11:35,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 4 [2024-11-14 04:11:35,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 04:11:35,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 04:11:35,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 04:11:38,011 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| 0))) (.cse6 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 0) (forall ((v_ArrVal_820 (Array Int Int))) (= (select (select (store .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| v_ArrVal_820) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse1) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 1)))) (or (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| Int) (v_arrayElimArr_37 (Array Int Int)) (v_subst_9 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_37 v_subst_9))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 1)) (= (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| v_arrayElimArr_37))) (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse1) 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| Int) (v_subst_12 Int) (v_arrayElimArr_39 (Array Int Int))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 0) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_39 v_subst_12))) (= (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| v_arrayElimArr_39))) (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse6) 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 0) (forall ((v_arrayElimArr_37 (Array Int Int)) (v_subst_10 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_37 v_subst_10))) (= (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| v_arrayElimArr_37))) (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse1) 0))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| Int)) (or (forall ((v_DerPreprocessor_66 Int) (v_arrayElimArr_37 (Array Int Int)) (v_subst_11 Int) (v_subst_10 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_37 v_subst_10))) (not (= (select (store (store v_arrayElimArr_37 v_subst_10 v_DerPreprocessor_66) v_subst_11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_10) v_DerPreprocessor_66)) (= (select (select (let ((.cse8 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| v_arrayElimArr_37))) (store .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse1) 0))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| Int) (v_arrayElimArr_37 (Array Int Int)) (v_subst_11 Int)) (or (not (= (select v_arrayElimArr_37 v_subst_11) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 1)) (= (select (select (let ((.cse9 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| v_arrayElimArr_37))) (store .cse9 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse9 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse1) 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 0) (forall ((v_arrayElimArr_40 (Array Int Int)) (v_subst_10 Int)) (or (not (= (select (select (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| v_arrayElimArr_40))) (store .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_40 v_subst_10))))) (forall ((v_prenex_44 (Array Int Int))) (not (= (select (select (store .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| v_prenex_44) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| Int)) (let ((.cse12 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 0) (forall ((v_arrayElimArr_38 (Array Int Int)) (v_subst_11 Int) (v_DerPreprocessor_76 Int) (v_subst_10 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_38 v_subst_11))) (not (= (select (select (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| v_arrayElimArr_38))) (store .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse12) 0)) (not (= v_DerPreprocessor_76 (select (store (store v_arrayElimArr_38 v_subst_11 v_DerPreprocessor_76) v_subst_10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_11))))) (forall ((v_prenex_42 (Array Int Int))) (not (= (select (select (store .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| v_prenex_42) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse12) 0))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 1))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 0) (forall ((v_subst_12 Int) (v_arrayElimArr_37 (Array Int Int)) (v_subst_10 Int) (v_DerPreprocessor_62 Int)) (or (not (= v_DerPreprocessor_62 (select (store (store v_arrayElimArr_37 v_subst_10 v_DerPreprocessor_62) v_subst_12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_10))) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_37 v_subst_10))) (= (select (select (let ((.cse13 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| v_arrayElimArr_37))) (store .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse1) 0))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 0) (forall ((v_arrayElimArr_39 (Array Int Int)) (v_DerPreprocessor_80 Int) (v_subst_11 Int) (v_subst_10 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_39 v_subst_11))) (= (select (select (let ((.cse14 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| v_arrayElimArr_39))) (store .cse14 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse14 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse6) 0) (not (= v_DerPreprocessor_80 (select (store (store v_arrayElimArr_39 v_subst_11 v_DerPreprocessor_80) v_subst_10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_11))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| Int) (v_subst_12 Int) (v_arrayElimArr_37 (Array Int Int))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 0) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_37 v_subst_12))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 1)) (= (select (select (let ((.cse15 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| v_arrayElimArr_37))) (store .cse15 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse15 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse1) 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| Int)) (or (forall ((v_prenex_46 (Array Int Int))) (= (select (select (store .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| v_prenex_46) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse6) 0)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 1)) (forall ((v_DerPreprocessor_69 Int) (v_arrayElimArr_39 (Array Int Int)) (v_subst_11 Int) (v_subst_10 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_39 v_subst_10))) (not (= v_DerPreprocessor_69 (select (store (store v_arrayElimArr_39 v_subst_10 v_DerPreprocessor_69) v_subst_11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_10))) (= (select (select (let ((.cse16 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| v_arrayElimArr_39))) (store .cse16 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse16 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse6) 0))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 0) (forall ((v_arrayElimArr_37 (Array Int Int)) (v_DerPreprocessor_71 Int) (v_subst_11 Int) (v_subst_10 Int)) (or (not (= (select v_arrayElimArr_37 v_subst_11) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (not (= v_DerPreprocessor_71 (select (store (store v_arrayElimArr_37 v_subst_11 v_DerPreprocessor_71) v_subst_10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_11))) (= (select (select (let ((.cse17 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| v_arrayElimArr_37))) (store .cse17 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse17 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse1) 0))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 1)))))) is different from false [2024-11-14 04:11:38,260 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2024-11-14 04:11:38,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 144 [2024-11-14 04:11:38,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:11:38,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 204 [2024-11-14 04:11:38,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:11:38,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 167 [2024-11-14 04:11:38,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-14 04:11:38,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:11:38,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 79 [2024-11-14 04:11:38,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:11:38,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 41 [2024-11-14 04:11:38,605 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:11:38,610 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,612 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,620 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 04:11:38,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 19 [2024-11-14 04:11:38,628 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:11:38,635 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,635 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,639 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:11:38,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-14 04:11:38,644 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:11:38,649 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,650 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,654 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:11:38,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-14 04:11:38,659 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:11:38,663 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,664 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,668 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:11:38,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-14 04:11:38,672 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:11:38,677 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,678 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,683 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:11:38,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-14 04:11:38,689 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:11:38,696 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,697 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,703 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:11:38,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-14 04:11:38,708 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:11:38,714 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,715 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,720 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:11:38,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-14 04:11:38,733 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:11:38,739 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,740 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,745 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:11:38,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-14 04:11:38,753 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:11:38,761 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,762 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,767 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:11:38,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 1 [2024-11-14 04:11:38,775 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,775 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,779 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:11:38,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 1 [2024-11-14 04:11:38,783 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:11:38,788 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,789 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,793 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:11:38,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-14 04:11:38,798 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:11:38,804 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,805 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,810 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:11:38,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 1 [2024-11-14 04:11:38,815 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:11:38,820 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,821 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:11:38,825 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:11:38,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-14 04:11:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 1 not checked. [2024-11-14 04:11:38,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308430188] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:11:38,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [446250021] [2024-11-14 04:11:38,948 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2024-11-14 04:11:38,948 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:11:38,949 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:11:38,949 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:11:38,949 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:11:40,338 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 42 for LOIs [2024-11-14 04:11:40,356 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 11 for LOIs [2024-11-14 04:11:40,518 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 9 for LOIs [2024-11-14 04:11:40,520 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 95 for LOIs [2024-11-14 04:11:40,531 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 9 for LOIs [2024-11-14 04:11:40,552 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:11:44,996 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5125#(and (= |~#s_can_fail_allocator_static~0.base| 4) (= |~#s_can_fail_allocator_static~0.offset| 0) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_#t~ret334#1_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~rval~2#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~rval~2#1.base_BEFORE_CALL_3| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_rbegin_#t~ret334#1_BEFORE_CALL_1| 0) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_26|) 24) |v_ULTIMATE.start_aws_linked_list_rbegin_~rval~2#1.base_BEFORE_CALL_3|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_26|) 24) |v_ULTIMATE.start_aws_linked_list_rbegin_~rval~2#1.offset_BEFORE_CALL_3|))) (= ~tl_last_error~0 0))' at error location [2024-11-14 04:11:44,996 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:11:44,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:11:44,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 30 [2024-11-14 04:11:44,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182791609] [2024-11-14 04:11:44,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:11:44,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-14 04:11:44,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:11:44,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-14 04:11:45,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2677, Unknown=2, NotChecked=210, Total=3080 [2024-11-14 04:11:45,000 INFO L87 Difference]: Start difference. First operand 119 states and 150 transitions. Second operand has 30 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 30 states have internal predecessors, (72), 12 states have call successors, (23), 4 states have call predecessors, (23), 7 states have return successors, (22), 9 states have call predecessors, (22), 12 states have call successors, (22) [2024-11-14 04:11:52,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:11:52,797 INFO L93 Difference]: Finished difference Result 373 states and 492 transitions. [2024-11-14 04:11:52,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 04:11:52,798 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 30 states have internal predecessors, (72), 12 states have call successors, (23), 4 states have call predecessors, (23), 7 states have return successors, (22), 9 states have call predecessors, (22), 12 states have call successors, (22) Word has length 49 [2024-11-14 04:11:52,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:11:52,802 INFO L225 Difference]: With dead ends: 373 [2024-11-14 04:11:52,802 INFO L226 Difference]: Without dead ends: 248 [2024-11-14 04:11:52,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 105 SyntacticMatches, 9 SemanticMatches, 78 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1838 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=381, Invalid=5631, Unknown=2, NotChecked=306, Total=6320 [2024-11-14 04:11:52,805 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 152 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 2043 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 2520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 376 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:11:52,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 807 Invalid, 2520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2043 Invalid, 0 Unknown, 376 Unchecked, 4.8s Time] [2024-11-14 04:11:52,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-14 04:11:52,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 185. [2024-11-14 04:11:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 123 states have (on average 1.2682926829268293) internal successors, (156), 129 states have internal predecessors, (156), 41 states have call successors, (41), 17 states have call predecessors, (41), 20 states have return successors, (41), 38 states have call predecessors, (41), 38 states have call successors, (41) [2024-11-14 04:11:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 238 transitions. [2024-11-14 04:11:52,891 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 238 transitions. Word has length 49 [2024-11-14 04:11:52,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:11:52,891 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 238 transitions. [2024-11-14 04:11:52,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 30 states have internal predecessors, (72), 12 states have call successors, (23), 4 states have call predecessors, (23), 7 states have return successors, (22), 9 states have call predecessors, (22), 12 states have call successors, (22) [2024-11-14 04:11:52,892 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 238 transitions. [2024-11-14 04:11:52,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-14 04:11:52,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:11:52,893 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-14 04:11:52,917 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 04:11:53,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-14 04:11:53,098 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:11:53,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:11:53,098 INFO L85 PathProgramCache]: Analyzing trace with hash 374699818, now seen corresponding path program 2 times [2024-11-14 04:11:53,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:11:53,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415597584] [2024-11-14 04:11:53,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:11:53,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:11:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:11:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 04:11:56,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:11:56,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415597584] [2024-11-14 04:11:56,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415597584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:11:56,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363978619] [2024-11-14 04:11:56,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 04:11:56,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:11:56,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:11:56,072 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:11:56,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 04:11:56,371 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 04:11:56,371 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:11:56,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 04:11:56,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:11:56,457 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-14 04:11:56,458 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:11:56,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363978619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:11:56,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:11:56,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2024-11-14 04:11:56,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079602565] [2024-11-14 04:11:56,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:11:56,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:11:56,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:11:56,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:11:56,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2024-11-14 04:11:56,460 INFO L87 Difference]: Start difference. First operand 185 states and 238 transitions. Second operand has 5 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-14 04:11:56,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:11:56,620 INFO L93 Difference]: Finished difference Result 242 states and 312 transitions. [2024-11-14 04:11:56,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:11:56,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 56 [2024-11-14 04:11:56,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:11:56,623 INFO L225 Difference]: With dead ends: 242 [2024-11-14 04:11:56,623 INFO L226 Difference]: Without dead ends: 189 [2024-11-14 04:11:56,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2024-11-14 04:11:56,624 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:11:56,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:11:56,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-14 04:11:56,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2024-11-14 04:11:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 124 states have (on average 1.2661290322580645) internal successors, (157), 131 states have internal predecessors, (157), 41 states have call successors, (41), 17 states have call predecessors, (41), 21 states have return successors, (42), 38 states have call predecessors, (42), 38 states have call successors, (42) [2024-11-14 04:11:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 240 transitions. [2024-11-14 04:11:56,725 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 240 transitions. Word has length 56 [2024-11-14 04:11:56,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:11:56,725 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 240 transitions. [2024-11-14 04:11:56,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-14 04:11:56,726 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 240 transitions. [2024-11-14 04:11:56,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-14 04:11:56,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:11:56,727 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-14 04:11:56,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 04:11:56,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:11:56,928 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:11:56,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:11:56,928 INFO L85 PathProgramCache]: Analyzing trace with hash 250649550, now seen corresponding path program 1 times [2024-11-14 04:11:56,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:11:56,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133568684] [2024-11-14 04:11:56,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:11:56,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:11:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:11:57,378 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 04:11:57,378 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:11:57,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133568684] [2024-11-14 04:11:57,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133568684] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:11:57,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160793712] [2024-11-14 04:11:57,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:11:57,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:11:57,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:11:57,381 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:11:57,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 04:11:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:11:57,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-14 04:11:57,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:11:57,901 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 04:11:57,902 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:11:57,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160793712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:11:57,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:11:57,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2024-11-14 04:11:57,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312407925] [2024-11-14 04:11:57,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:11:57,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 04:11:57,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:11:57,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 04:11:57,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-14 04:11:57,905 INFO L87 Difference]: Start difference. First operand 187 states and 240 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-14 04:11:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:11:58,189 INFO L93 Difference]: Finished difference Result 255 states and 324 transitions. [2024-11-14 04:11:58,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:11:58,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 58 [2024-11-14 04:11:58,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:11:58,192 INFO L225 Difference]: With dead ends: 255 [2024-11-14 04:11:58,192 INFO L226 Difference]: Without dead ends: 195 [2024-11-14 04:11:58,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-14 04:11:58,193 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 15 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:11:58,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 207 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:11:58,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-14 04:11:58,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 187. [2024-11-14 04:11:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 124 states have (on average 1.2580645161290323) internal successors, (156), 131 states have internal predecessors, (156), 41 states have call successors, (41), 17 states have call predecessors, (41), 21 states have return successors, (42), 38 states have call predecessors, (42), 38 states have call successors, (42) [2024-11-14 04:11:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 239 transitions. [2024-11-14 04:11:58,297 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 239 transitions. Word has length 58 [2024-11-14 04:11:58,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:11:58,297 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 239 transitions. [2024-11-14 04:11:58,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-14 04:11:58,297 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 239 transitions. [2024-11-14 04:11:58,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-14 04:11:58,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:11:58,299 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-14 04:11:58,322 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 04:11:58,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-14 04:11:58,503 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:11:58,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:11:58,504 INFO L85 PathProgramCache]: Analyzing trace with hash 697888874, now seen corresponding path program 1 times [2024-11-14 04:11:58,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:11:58,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456386226] [2024-11-14 04:11:58,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:11:58,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:11:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:11:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 04:11:59,070 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:11:59,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456386226] [2024-11-14 04:11:59,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456386226] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:11:59,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445953002] [2024-11-14 04:11:59,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:11:59,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:11:59,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:11:59,073 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:11:59,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 04:11:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:11:59,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-14 04:11:59,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:11:59,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-14 04:11:59,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-14 04:12:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-14 04:12:02,452 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:12:07,912 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 04:12:07,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445953002] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:12:07,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1058104894] [2024-11-14 04:12:07,915 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2024-11-14 04:12:07,915 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:12:07,915 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:12:07,915 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:12:07,915 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:12:10,046 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 46 for LOIs [2024-11-14 04:12:10,084 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 17 for LOIs [2024-11-14 04:12:10,331 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 12 for LOIs [2024-11-14 04:12:10,333 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 95 for LOIs [2024-11-14 04:12:10,343 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 25 for LOIs [2024-11-14 04:12:10,362 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:12:25,572 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8128#(and (<= 1 |#StackHeapBarrier|) (= |~#s_can_fail_allocator_static~0.base| 4) (= |~#s_can_fail_allocator_static~0.offset| 0) (= ~tl_last_error~0 0) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_#t~ret334#1_BEFORE_CALL_2| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_56| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#res#1_43| Int)) (and (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#t~ret322#1_74| Int)) (= (mod |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#t~ret322#1_74| 256) 0)) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_56| 0) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#res#1_43| 0) (= |v_ULTIMATE.start_aws_linked_list_rbegin_#t~ret334#1_BEFORE_CALL_2| 0) (= |__VERIFIER_assert_#in~cond| 0))))' at error location [2024-11-14 04:12:25,572 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:12:25,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:12:25,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 16] total 32 [2024-11-14 04:12:25,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034495185] [2024-11-14 04:12:25,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:12:25,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-14 04:12:25,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:12:25,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-14 04:12:25,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=3065, Unknown=2, NotChecked=0, Total=3306 [2024-11-14 04:12:25,576 INFO L87 Difference]: Start difference. First operand 187 states and 239 transitions. Second operand has 32 states, 27 states have (on average 3.0) internal successors, (81), 27 states have internal predecessors, (81), 12 states have call successors, (24), 3 states have call predecessors, (24), 11 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-14 04:12:31,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:12:31,600 INFO L93 Difference]: Finished difference Result 412 states and 526 transitions. [2024-11-14 04:12:31,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-14 04:12:31,601 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 3.0) internal successors, (81), 27 states have internal predecessors, (81), 12 states have call successors, (24), 3 states have call predecessors, (24), 11 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) Word has length 64 [2024-11-14 04:12:31,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:12:31,603 INFO L225 Difference]: With dead ends: 412 [2024-11-14 04:12:31,603 INFO L226 Difference]: Without dead ends: 238 [2024-11-14 04:12:31,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 132 SyntacticMatches, 14 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2445 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=510, Invalid=6628, Unknown=2, NotChecked=0, Total=7140 [2024-11-14 04:12:31,607 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 87 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:12:31,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 677 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-14 04:12:31,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-14 04:12:31,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 202. [2024-11-14 04:12:31,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 134 states have (on average 1.2164179104477613) internal successors, (163), 142 states have internal predecessors, (163), 44 states have call successors, (44), 18 states have call predecessors, (44), 23 states have return successors, (47), 41 states have call predecessors, (47), 41 states have call successors, (47) [2024-11-14 04:12:31,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 254 transitions. [2024-11-14 04:12:31,712 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 254 transitions. Word has length 64 [2024-11-14 04:12:31,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:12:31,712 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 254 transitions. [2024-11-14 04:12:31,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 3.0) internal successors, (81), 27 states have internal predecessors, (81), 12 states have call successors, (24), 3 states have call predecessors, (24), 11 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-14 04:12:31,712 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 254 transitions. [2024-11-14 04:12:31,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-14 04:12:31,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:12:31,714 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-14 04:12:31,741 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 04:12:31,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:12:31,914 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:12:31,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:12:31,915 INFO L85 PathProgramCache]: Analyzing trace with hash 2078352713, now seen corresponding path program 1 times [2024-11-14 04:12:31,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:12:31,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336875189] [2024-11-14 04:12:31,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:12:31,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:12:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:12:32,748 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-14 04:12:32,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:12:32,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336875189] [2024-11-14 04:12:32,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336875189] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:12:32,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146471424] [2024-11-14 04:12:32,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:12:32,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:12:32,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:12:32,752 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:12:32,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-14 04:12:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:12:33,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-11-14 04:12:33,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:12:33,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-14 04:12:33,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-14 04:12:33,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:12:33,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:12:33,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2024-11-14 04:12:33,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:12:33,490 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 34 treesize of output 25 [2024-11-14 04:12:33,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:12:33,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:12:33,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2024-11-14 04:12:33,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:12:33,536 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 34 treesize of output 25 [2024-11-14 04:12:33,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:12:33,681 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 51 treesize of output 38 [2024-11-14 04:12:33,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:12:33,708 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 34 treesize of output 25 [2024-11-14 04:12:33,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:12:33,752 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2024-11-14 04:12:33,752 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 61 [2024-11-14 04:12:33,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:12:33,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:12:33,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 25 [2024-11-14 04:12:33,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:12:33,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 54 [2024-11-14 04:12:33,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:12:33,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:12:33,946 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 54 treesize of output 47 [2024-11-14 04:12:33,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2024-11-14 04:12:40,158 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-14 04:12:40,159 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:12:47,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:12:47,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 564 treesize of output 687 [2024-11-14 04:12:47,826 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-11-14 04:12:47,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 119 [2024-11-14 04:12:47,904 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-11-14 04:12:47,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 119 [2024-11-14 04:12:48,047 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-11-14 04:12:48,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 119 [2024-11-14 04:12:48,118 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-11-14 04:12:48,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 119 [2024-11-14 04:12:48,224 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:12:48,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2024-11-14 04:12:48,830 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:12:48,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2024-11-14 04:12:48,892 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:12:48,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2024-11-14 04:12:50,814 INFO L349 Elim1Store]: treesize reduction 87, result has 14.7 percent of original size [2024-11-14 04:12:50,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 260 treesize of output 226 [2024-11-14 04:12:51,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2024-11-14 04:12:51,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2024-11-14 04:12:51,383 INFO L349 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2024-11-14 04:12:51,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 130 treesize of output 121 [2024-11-14 04:12:51,483 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 04:12:51,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 4 [2024-11-14 04:12:52,475 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (forall ((v_ArrVal_1306 (Array Int Int)) (v_prenex_95 Int) (v_arrayElimArr_60 (Array Int Int))) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_60 v_prenex_95))) (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_60))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_96 Int)) (let ((.cse3 (select (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_97))) (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_96))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= (select .cse3 .cse4) 0) (not (= (select .cse3 .cse2) 0))))))) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse6 (select (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (select .cse6 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_57 (Array Int Int)) (v_prenex_89 Int) (v_DerPreprocessor_143 Int) (v_prenex_92 Int) (v_DerPreprocessor_126 Int)) (let ((.cse7 (store (store v_arrayElimArr_57 v_prenex_89 v_DerPreprocessor_126) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (.cse8 (select (let ((.cse9 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse9 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse9 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (select .cse7 v_prenex_89) v_DerPreprocessor_126)) (= v_prenex_92 v_prenex_89) (not (= .cse7 (store (store (store v_arrayElimArr_57 v_prenex_89 v_DerPreprocessor_143) v_prenex_92 (select .cse7 v_prenex_92)) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_89))) (not (= (select .cse8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= (select .cse8 .cse2) 0))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (not (= (select .cse6 .cse2) 0))))) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse11 (select (let ((.cse14 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse14 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse14 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (select .cse11 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_57 (Array Int Int)) (v_prenex_92 Int)) (let ((.cse12 (select (let ((.cse13 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_92))) (not (= (select .cse12 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= (select .cse12 .cse2) 0))))) (not (= (select .cse11 .cse2) 0))))) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse19 (select (let ((.cse20 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse20 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse20 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_57 (Array Int Int)) (v_prenex_89 Int) (v_prenex_95 Int) (v_DerPreprocessor_102 Int) (v_DerPreprocessor_147 Int) (v_prenex_92 Int)) (let ((.cse16 (store v_arrayElimArr_57 v_prenex_89 v_DerPreprocessor_147))) (let ((.cse15 (store (store .cse16 v_prenex_92 v_DerPreprocessor_102) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (.cse17 (select (let ((.cse18 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse18 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse18 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (store (store v_arrayElimArr_57 v_prenex_89 (select .cse15 v_prenex_89)) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse15)) (not (= (select (store .cse16 v_prenex_92 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_89) v_DerPreprocessor_147)) (not (= (select .cse15 v_prenex_92) v_DerPreprocessor_102)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_89))) (not (= (select .cse17 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= (select .cse17 .cse2) 0)))))) (not (= (select .cse19 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (not (= (select .cse19 .cse2) 0))))) (or (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| 0)) (and (forall ((v_ArrVal_1307 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_87 Int) (v_prenex_88 (Array Int Int))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (not (= (select (select (let ((.cse21 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_88))) (store .cse21 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse21 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_87))) 0) 16) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_59 (Array Int Int)) (v_DerPreprocessor_93 Int) (v_prenex_95 Int) (v_prenex_86 Int) (v_DerPreprocessor_135 Int) (v_prenex_92 Int)) (let ((.cse22 (store v_arrayElimArr_59 v_prenex_86 v_DerPreprocessor_135))) (let ((.cse23 (store (store .cse22 v_prenex_92 v_DerPreprocessor_93) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (or (not (= v_DerPreprocessor_135 (select (store .cse22 v_prenex_92 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_86))) (not (= v_DerPreprocessor_93 (select .cse23 v_prenex_92))) (not (= (select (select (let ((.cse24 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_59))) (store .cse24 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse24 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) 0) 16) 0)) (not (= (select v_arrayElimArr_59 v_prenex_86) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (not (= .cse23 (store (store v_arrayElimArr_59 v_prenex_86 (select .cse23 v_prenex_86)) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))))))))) (forall ((v_ArrVal_1307 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_87 Int) (v_prenex_88 (Array Int Int))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (not (= (select (select (let ((.cse25 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_88))) (store .cse25 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse25 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_87))) 0) 16) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_59 (Array Int Int)) (v_prenex_86 Int)) (or (not (= (select (select (let ((.cse26 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_59))) (store .cse26 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse26 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) 0) 16) 0)) (not (= (select v_arrayElimArr_59 v_prenex_86) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))))) (forall ((v_ArrVal_1307 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_87 Int) (v_prenex_88 (Array Int Int))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (not (= (select (select (let ((.cse27 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_88))) (store .cse27 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse27 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_87))) 0) 16) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_59 (Array Int Int)) (v_DerPreprocessor_133 Int) (v_prenex_95 Int) (v_prenex_86 Int) (v_DerPreprocessor_113 Int) (v_prenex_92 Int)) (let ((.cse30 (store v_arrayElimArr_59 v_prenex_86 v_DerPreprocessor_133))) (or (not (= (select (select (let ((.cse28 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_59))) (store .cse28 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse28 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) 0) 16) 0)) (not (= (select v_arrayElimArr_59 v_prenex_86) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (= v_prenex_92 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|) (= v_prenex_95 v_prenex_92) (not (let ((.cse29 (store (store .cse30 v_prenex_92 (select (store (store .cse30 v_prenex_92 v_DerPreprocessor_113) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_92)) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (= .cse29 (store (store v_arrayElimArr_59 v_prenex_86 (select .cse29 v_prenex_86)) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (not (= (select (store .cse30 v_prenex_92 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_86) v_DerPreprocessor_133)))))))) (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 0))) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse31 (select (let ((.cse36 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse36 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse36 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (select .cse31 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_57 (Array Int Int)) (v_prenex_89 Int) (v_prenex_92 Int) (v_DerPreprocessor_149 Int) (v_DerPreprocessor_117 Int)) (let ((.cse32 (store v_arrayElimArr_57 v_prenex_89 v_DerPreprocessor_149)) (.cse33 (store (store v_arrayElimArr_57 v_prenex_89 v_DerPreprocessor_117) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (.cse34 (select (let ((.cse35 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse35 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse35 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= v_DerPreprocessor_149 (select (store .cse32 v_prenex_92 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_89))) (not (= (store (store .cse32 v_prenex_92 (select .cse33 v_prenex_92)) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse33)) (not (= v_DerPreprocessor_117 (select .cse33 v_prenex_89))) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_89))) (not (= (select .cse34 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= (select .cse34 .cse2) 0))))) (not (= (select .cse31 .cse2) 0))))) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse40 (select (let ((.cse41 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse41 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse41 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_57 (Array Int Int)) (v_prenex_89 Int) (v_DerPreprocessor_141 Int) (v_prenex_95 Int) (v_prenex_92 Int) (v_DerPreprocessor_95 Int)) (let ((.cse37 (store (store (store v_arrayElimArr_57 v_prenex_89 v_DerPreprocessor_141) v_prenex_92 v_DerPreprocessor_95) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (.cse38 (select (let ((.cse39 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse39 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse39 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= v_prenex_92 v_prenex_89) (not (= (select .cse37 v_prenex_92) v_DerPreprocessor_95)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_89))) (not (= (select .cse38 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= .cse37 (store (store v_arrayElimArr_57 v_prenex_89 (select .cse37 v_prenex_89)) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (not (= (select .cse38 .cse2) 0))))) (not (= (select .cse40 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (not (= (select .cse40 .cse2) 0))))) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse42 (select (let ((.cse47 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse47 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse47 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (select .cse42 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_57 (Array Int Int)) (v_prenex_89 Int) (v_prenex_95 Int) (v_prenex_92 Int) (v_DerPreprocessor_115 Int) (v_DerPreprocessor_139 Int)) (let ((.cse44 (store v_arrayElimArr_57 v_prenex_89 v_DerPreprocessor_139)) (.cse45 (select (let ((.cse46 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse46 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse46 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (let ((.cse43 (store (store .cse44 v_prenex_92 (select (store (store .cse44 v_prenex_92 v_DerPreprocessor_115) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_92)) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (= (store (store v_arrayElimArr_57 v_prenex_89 (select .cse43 v_prenex_89)) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse43))) (not (= (select (store .cse44 v_prenex_92 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_89) v_DerPreprocessor_139)) (= v_prenex_92 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|) (= v_prenex_95 v_prenex_92) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_89))) (not (= (select .cse45 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= (select .cse45 .cse2) 0))))) (not (= (select .cse42 .cse2) 0))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int)) (or (forall ((v_DerPreprocessor_129 Int) (|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_1306 (Array Int Int)) (v_prenex_92 Int) (v_arrayElimArr_61 (Array Int Int))) (let ((.cse48 (select (let ((.cse49 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_61))) (store .cse49 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse49 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_61 v_prenex_92))) (not (= (select .cse48 .cse2) 0)) (not (= v_DerPreprocessor_129 (select (store (store v_arrayElimArr_61 v_prenex_92 v_DerPreprocessor_129) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_92))) (= (select .cse48 .cse4) 0)))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_94 (Array Int Int)) (v_prenex_93 Int)) (not (= (select (select (let ((.cse50 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_94))) (store .cse50 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse50 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_93))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)))) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse51 (select (let ((.cse54 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse54 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse54 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (select .cse51 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_57 (Array Int Int)) (v_DerPreprocessor_122 Int) (v_prenex_92 Int)) (let ((.cse52 (select (let ((.cse53 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse53 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse53 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (select (store (store v_arrayElimArr_57 v_prenex_92 v_DerPreprocessor_122) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_92) v_DerPreprocessor_122)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_92))) (not (= (select .cse52 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= (select .cse52 .cse2) 0))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (not (= (select .cse51 .cse2) 0))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int)) (let ((.cse56 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_58 (Array Int Int))) (let ((.cse55 (select (let ((.cse57 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_58))) (store .cse57 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse57 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_58 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) (not (= (select .cse55 .cse2) 0)) (not (= (select .cse55 .cse56) 0))))) (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1311 (Array Int Int))) (let ((.cse58 (select (let ((.cse59 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_ArrVal_1311))) (store .cse59 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse59 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_1310))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (select .cse58 .cse56) 0)) (not (= (select .cse58 .cse2) 0)))))))) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse60 (select (let ((.cse63 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse63 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse63 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (select .cse60 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_57 (Array Int Int)) (v_DerPreprocessor_89 Int) (v_prenex_86 Int) (v_prenex_92 Int)) (let ((.cse61 (select (let ((.cse62 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse62 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse62 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_92))) (not (= (select .cse61 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= v_DerPreprocessor_89 (select (store (store v_arrayElimArr_57 v_prenex_92 v_DerPreprocessor_89) v_prenex_86 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_92))) (not (= (select .cse61 .cse2) 0))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (not (= (select .cse60 .cse2) 0))))) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse64 (select (let ((.cse69 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse69 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse69 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (select .cse64 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_1306 (Array Int Int)) (v_DerPreprocessor_119 Int) (v_arrayElimArr_57 (Array Int Int)) (v_prenex_89 Int) (v_prenex_95 Int) (v_DerPreprocessor_145 Int) (v_prenex_92 Int)) (let ((.cse67 (select (let ((.cse68 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse68 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse68 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= v_prenex_92 v_prenex_89) (not (let ((.cse65 (store (let ((.cse66 (store v_arrayElimArr_57 v_prenex_89 v_DerPreprocessor_145))) (store .cse66 v_prenex_92 (select (store (store .cse66 v_prenex_92 v_DerPreprocessor_119) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_92))) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (= (store (store v_arrayElimArr_57 v_prenex_89 (select .cse65 v_prenex_89)) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse65))) (= v_prenex_92 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|) (= v_prenex_95 v_prenex_92) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_89))) (not (= (select .cse67 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= (select .cse67 .cse2) 0))))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (not (= (select .cse64 .cse2) 0))))))) is different from false [2024-11-14 04:12:56,025 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse21 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse4 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| 0)))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse0 (select (let ((.cse8 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (not (= (select .cse0 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_57 (Array Int Int)) (v_prenex_89 Int) (v_prenex_95 Int) (v_DerPreprocessor_102 Int) (v_DerPreprocessor_147 Int) (v_prenex_92 Int)) (let ((.cse3 (store v_arrayElimArr_57 v_prenex_89 v_DerPreprocessor_147))) (let ((.cse1 (store (store .cse3 v_prenex_92 v_DerPreprocessor_102) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (.cse2 (select (let ((.cse5 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (store (store v_arrayElimArr_57 v_prenex_89 (select .cse1 v_prenex_89)) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1)) (not (= (select .cse2 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= (select (store .cse3 v_prenex_92 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_89) v_DerPreprocessor_147)) (not (= (select .cse1 v_prenex_92) v_DerPreprocessor_102)) (not (= (select .cse2 .cse4) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_89))))))) (not (= (select .cse0 .cse4) 0))))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse10 (select (let ((.cse14 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse14 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse14 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (not (= (select .cse10 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (not (= (select .cse10 .cse4) 0)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_57 (Array Int Int)) (v_prenex_89 Int) (v_DerPreprocessor_141 Int) (v_prenex_95 Int) (v_prenex_92 Int) (v_DerPreprocessor_95 Int)) (let ((.cse11 (select (let ((.cse13 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|)) (.cse12 (store (store (store v_arrayElimArr_57 v_prenex_89 v_DerPreprocessor_141) v_prenex_92 v_DerPreprocessor_95) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (or (= v_prenex_92 v_prenex_89) (not (= (select .cse11 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= (select .cse11 .cse4) 0)) (not (= (select .cse12 v_prenex_92) v_DerPreprocessor_95)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_89))) (not (= .cse12 (store (store v_arrayElimArr_57 v_prenex_89 (select .cse12 v_prenex_89)) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))))))))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse15 (select (let ((.cse18 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse18 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse18 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (not (= (select .cse15 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_57 (Array Int Int)) (v_DerPreprocessor_122 Int) (v_prenex_92 Int) (v_subst_20 Int)) (let ((.cse16 (select (let ((.cse17 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse17 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse17 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (select (store (store v_arrayElimArr_57 v_prenex_92 v_DerPreprocessor_122) v_subst_20 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_92) v_DerPreprocessor_122)) (not (= (select .cse16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_92))) (not (= (select .cse16 .cse4) 0))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (not (= (select .cse15 .cse4) 0))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int)) (or (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_94 (Array Int Int)) (v_prenex_93 Int)) (not (= (select (select (let ((.cse19 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_94))) (store .cse19 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse19 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_93))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse4) 0))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (forall ((v_DerPreprocessor_129 Int) (v_subst_15 Int) (v_ArrVal_1306 (Array Int Int)) (v_prenex_92 Int) (v_arrayElimArr_61 (Array Int Int))) (let ((.cse20 (select (let ((.cse22 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_61))) (store .cse22 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse22 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_61 v_prenex_92))) (not (= v_DerPreprocessor_129 (select (store (store v_arrayElimArr_61 v_prenex_92 v_DerPreprocessor_129) v_subst_15 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_92))) (= (select .cse20 .cse21) 0) (not (= (select .cse20 .cse4) 0))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse23 (select (let ((.cse27 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse27 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse27 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (not (= (select .cse23 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_57 (Array Int Int)) (v_prenex_89 Int) (v_subst_17 Int) (v_DerPreprocessor_143 Int) (v_prenex_92 Int) (v_DerPreprocessor_126 Int)) (let ((.cse24 (store (store v_arrayElimArr_57 v_prenex_89 v_DerPreprocessor_126) v_subst_17 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (.cse25 (select (let ((.cse26 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse26 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse26 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= v_prenex_92 v_prenex_89) (not (= (select .cse24 v_prenex_89) v_DerPreprocessor_126)) (not (= (select .cse25 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= (store (store (store v_arrayElimArr_57 v_prenex_89 v_DerPreprocessor_143) v_prenex_92 (select .cse24 v_prenex_92)) v_subst_17 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse24)) (not (= (select .cse25 .cse4) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_89)))))) (not (= (select .cse23 .cse4) 0))))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse28 (select (let ((.cse33 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse33 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse33 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (not (= (select .cse28 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (not (= (select .cse28 .cse4) 0)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_57 (Array Int Int)) (v_prenex_89 Int) (v_subst_18 Int) (v_prenex_95 Int) (v_prenex_92 Int) (v_DerPreprocessor_115 Int) (v_DerPreprocessor_139 Int)) (let ((.cse29 (store v_arrayElimArr_57 v_prenex_89 v_DerPreprocessor_139)) (.cse30 (select (let ((.cse32 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse32 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse32 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (select (store .cse29 v_prenex_92 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_89) v_DerPreprocessor_139)) (= v_prenex_92 v_subst_18) (not (= (select .cse30 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (let ((.cse31 (store (store .cse29 v_prenex_92 (select (store (store .cse29 v_prenex_92 v_DerPreprocessor_115) v_subst_18 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_92)) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (= (store (store v_arrayElimArr_57 v_prenex_89 (select .cse31 v_prenex_89)) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse31))) (not (= (select .cse30 .cse4) 0)) (= v_prenex_95 v_prenex_92) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_89))))))))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse34 (select (let ((.cse37 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse37 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse37 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (not (= (select .cse34 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_57 (Array Int Int)) (v_prenex_92 Int)) (let ((.cse35 (select (let ((.cse36 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse36 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse36 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (select .cse35 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_92))) (not (= (select .cse35 .cse4) 0))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (not (= (select .cse34 .cse4) 0))))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse38 (select (let ((.cse43 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse43 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse43 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (not (= (select .cse38 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_57 (Array Int Int)) (v_subst_19 Int) (v_prenex_89 Int) (v_prenex_92 Int) (v_DerPreprocessor_149 Int) (v_DerPreprocessor_117 Int)) (let ((.cse40 (store v_arrayElimArr_57 v_prenex_89 v_DerPreprocessor_149)) (.cse39 (store (store v_arrayElimArr_57 v_prenex_89 v_DerPreprocessor_117) v_subst_19 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (.cse41 (select (let ((.cse42 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse42 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse42 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= v_DerPreprocessor_117 (select .cse39 v_prenex_89))) (not (= v_DerPreprocessor_149 (select (store .cse40 v_prenex_92 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_89))) (not (= (select .cse41 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= .cse39 (store (store .cse40 v_prenex_92 (select .cse39 v_prenex_92)) v_subst_19 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (not (= (select .cse41 .cse4) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_89)))))) (not (= (select .cse38 .cse4) 0))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)))) (or (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 0)) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)) (forall ((v_ArrVal_1307 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_87 Int) (v_prenex_88 (Array Int Int))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (not (= (select (select (let ((.cse44 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_88))) (store .cse44 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse44 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_87))) 0) 16) 0)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_59 (Array Int Int)) (v_prenex_86 Int)) (or (not (= (select v_arrayElimArr_59 v_prenex_86) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (not (= (select (select (let ((.cse45 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_59))) (store .cse45 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse45 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) 0) 16) 0)))))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)) (forall ((v_ArrVal_1307 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_87 Int) (v_prenex_88 (Array Int Int))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_59 (Array Int Int)) (v_DerPreprocessor_93 Int) (v_prenex_95 Int) (v_prenex_86 Int) (v_DerPreprocessor_135 Int) (v_prenex_92 Int)) (let ((.cse46 (store v_arrayElimArr_59 v_prenex_86 v_DerPreprocessor_135))) (let ((.cse47 (store (store .cse46 v_prenex_92 v_DerPreprocessor_93) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (or (not (= v_DerPreprocessor_135 (select (store .cse46 v_prenex_92 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_86))) (not (= v_DerPreprocessor_93 (select .cse47 v_prenex_92))) (not (= (select v_arrayElimArr_59 v_prenex_86) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (not (= (select (select (let ((.cse48 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_59))) (store .cse48 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse48 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) 0) 16) 0)) (not (= .cse47 (store (store v_arrayElimArr_59 v_prenex_86 (select .cse47 v_prenex_86)) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (not (= (select (select (let ((.cse49 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_88))) (store .cse49 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse49 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_87))) 0) 16) 0)))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)) (forall ((v_ArrVal_1307 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_87 Int) (v_prenex_88 (Array Int Int))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (forall ((v_ArrVal_1306 (Array Int Int)) (v_subst_13 Int) (v_arrayElimArr_59 (Array Int Int)) (v_DerPreprocessor_133 Int) (v_prenex_95 Int) (v_prenex_86 Int) (v_DerPreprocessor_113 Int) (v_prenex_92 Int)) (let ((.cse51 (store v_arrayElimArr_59 v_prenex_86 v_DerPreprocessor_133))) (or (not (= (select v_arrayElimArr_59 v_prenex_86) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (not (let ((.cse50 (store (store .cse51 v_prenex_92 (select (store (store .cse51 v_prenex_92 v_DerPreprocessor_113) v_subst_13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_92)) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (= .cse50 (store (store v_arrayElimArr_59 v_prenex_86 (select .cse50 v_prenex_86)) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (not (= (select (select (let ((.cse52 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_59))) (store .cse52 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse52 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) 0) 16) 0)) (= v_prenex_95 v_prenex_92) (not (= (select (store .cse51 v_prenex_92 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_86) v_DerPreprocessor_133)) (= v_prenex_92 v_subst_13)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (not (= (select (select (let ((.cse53 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_88))) (store .cse53 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse53 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_87))) 0) 16) 0)))))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse54 (select (let ((.cse59 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse59 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse59 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (not (= (select .cse54 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_DerPreprocessor_119 Int) (v_arrayElimArr_57 (Array Int Int)) (v_prenex_89 Int) (v_subst_16 Int) (v_prenex_95 Int) (v_DerPreprocessor_145 Int) (v_prenex_92 Int)) (let ((.cse55 (select (let ((.cse58 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse58 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse58 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= v_prenex_92 v_prenex_89) (not (= (select .cse55 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (let ((.cse56 (store (let ((.cse57 (store v_arrayElimArr_57 v_prenex_89 v_DerPreprocessor_145))) (store .cse57 v_prenex_92 (select (store (store .cse57 v_prenex_92 v_DerPreprocessor_119) v_subst_16 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_92))) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (= .cse56 (store (store v_arrayElimArr_57 v_prenex_89 (select .cse56 v_prenex_89)) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (not (= (select .cse55 .cse4) 0)) (= v_prenex_95 v_prenex_92) (= v_prenex_92 v_subst_16) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_89)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (not (= (select .cse54 .cse4) 0))))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_prenex_95 Int) (v_arrayElimArr_60 (Array Int Int))) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_60 v_prenex_95))) (not (= (select (select (let ((.cse60 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_60))) (store .cse60 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse60 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse4) 0)))) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_96 Int)) (let ((.cse61 (select (let ((.cse62 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_97))) (store .cse62 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse62 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_96))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (select .cse61 .cse4) 0)) (= (select .cse61 .cse21) 0)))))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int)) (let ((.cse64 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1311 (Array Int Int))) (let ((.cse63 (select (let ((.cse65 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_ArrVal_1311))) (store .cse65 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse65 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_ArrVal_1310))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (select .cse63 .cse64) 0)) (not (= (select .cse63 .cse4) 0))))) (forall ((v_subst_14 Int) (v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_58 (Array Int Int))) (let ((.cse66 (select (let ((.cse67 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_58))) (store .cse67 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse67 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (select .cse66 .cse64) 0)) (not (= 0 (select .cse66 .cse4))) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_58 v_subst_14)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse70 (select (let ((.cse71 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse71 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse71 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_57 (Array Int Int)) (v_DerPreprocessor_89 Int) (v_prenex_86 Int) (v_prenex_92 Int)) (let ((.cse68 (select (let ((.cse69 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse69 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse69 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (select .cse68 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_92))) (not (= (select .cse68 .cse4) 0)) (not (= v_DerPreprocessor_89 (select (store (store v_arrayElimArr_57 v_prenex_92 v_DerPreprocessor_89) v_prenex_86 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_92)))))) (not (= (select .cse70 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (not (= (select .cse70 .cse4) 0))))))))) is different from true [2024-11-14 04:12:56,636 INFO L349 Elim1Store]: treesize reduction 175, result has 36.4 percent of original size [2024-11-14 04:12:56,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 4173 treesize of output 3040 [2024-11-14 04:12:56,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:12:56,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1650 treesize of output 1616 [2024-11-14 04:12:56,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 919 treesize of output 889 [2024-11-14 04:12:56,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1097 treesize of output 1037 [2024-11-14 04:12:57,173 INFO L349 Elim1Store]: treesize reduction 175, result has 36.4 percent of original size [2024-11-14 04:12:57,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1029 treesize of output 820 [2024-11-14 04:12:57,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:12:57,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3174 treesize of output 2898 [2024-11-14 04:12:57,415 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:12:58,007 INFO L349 Elim1Store]: treesize reduction 441, result has 22.8 percent of original size [2024-11-14 04:12:58,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 24 case distinctions, treesize of input 1172 treesize of output 1264 [2024-11-14 04:12:58,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 939 treesize of output 909 [2024-11-14 04:13:02,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-11-14 04:13:02,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:13:02,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 104 [2024-11-14 04:13:03,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 142 [2024-11-14 04:13:04,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:13:04,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1189 treesize of output 1217 [2024-11-14 04:13:19,149 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:21,582 INFO L349 Elim1Store]: treesize reduction 16, result has 77.5 percent of original size [2024-11-14 04:13:21,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 44274 treesize of output 42936 [2024-11-14 04:13:28,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:13:28,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:13:28,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 70 [2024-11-14 04:13:28,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 182 [2024-11-14 04:13:28,698 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:28,699 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:28,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 124 [2024-11-14 04:13:28,713 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:28,714 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:28,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2024-11-14 04:13:28,727 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:28,728 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:28,735 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:28,736 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:28,737 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:28,740 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:28,758 INFO L349 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2024-11-14 04:13:28,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 83 [2024-11-14 04:13:28,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:13:28,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:13:28,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 50 [2024-11-14 04:13:28,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 210 [2024-11-14 04:13:28,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:13:28,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 119 [2024-11-14 04:13:28,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 87 [2024-11-14 04:13:28,874 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:28,875 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:28,891 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-14 04:13:28,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 211 treesize of output 188 [2024-11-14 04:13:29,087 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,088 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,089 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,094 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:13:29,102 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,103 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,104 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,110 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:13:29,118 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,119 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,121 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,125 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:13:29,134 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,135 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,136 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,142 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:13:29,149 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,150 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,152 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,157 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:13:29,165 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,166 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,168 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,173 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:13:29,188 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,189 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:13:29,234 INFO L349 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2024-11-14 04:13:29,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 38 [2024-11-14 04:13:29,242 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,243 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2024-11-14 04:13:29,258 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,258 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:13:29,282 INFO L349 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2024-11-14 04:13:29,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 38 [2024-11-14 04:13:29,288 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 57 [2024-11-14 04:13:29,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 04:13:29,309 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 49 treesize of output 47 [2024-11-14 04:13:29,318 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,330 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 04:13:29,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 57 [2024-11-14 04:13:29,350 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,354 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-14 04:13:29,364 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,364 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,365 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,370 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:13:29,377 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,377 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,378 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,383 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:13:29,396 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,397 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,399 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,405 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:13:29,412 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,413 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,415 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,423 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:13:29,434 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,436 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,438 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,445 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:13:29,456 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,458 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,460 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:13:29,467 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:13:29,788 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 3 not checked. [2024-11-14 04:13:29,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146471424] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:13:29,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [996481018] [2024-11-14 04:13:29,794 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2024-11-14 04:13:29,795 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:13:29,795 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:13:29,795 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:13:29,795 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:13:30,943 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 68 for LOIs [2024-11-14 04:13:30,992 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 11 for LOIs [2024-11-14 04:13:31,159 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 9 for LOIs [2024-11-14 04:13:31,161 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 95 for LOIs [2024-11-14 04:13:31,171 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 9 for LOIs [2024-11-14 04:13:31,187 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:13:39,003 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9557#(and (= |~#s_can_fail_allocator_static~0.base| 4) (= |~#s_can_fail_allocator_static~0.offset| 0) (= ~tl_last_error~0 0) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_#t~ret334#1_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_59| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~rval~2#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~rval~2#1.base_BEFORE_CALL_11| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_rbegin_#t~ret334#1_BEFORE_CALL_3| 0) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_#t~ret332#1_35| Int)) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_#t~ret332#1_35| 1) (<= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_#t~ret332#1_35|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_~rval~2#1.offset_BEFORE_CALL_11| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_59|) 24)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_~rval~2#1.base_BEFORE_CALL_11| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_59|) 24)) (= |__VERIFIER_assert_#in~cond| 0))))' at error location [2024-11-14 04:13:39,003 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:13:39,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:13:39,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 13] total 35 [2024-11-14 04:13:39,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253689915] [2024-11-14 04:13:39,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:13:39,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-14 04:13:39,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:13:39,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-14 04:13:39,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=3197, Unknown=7, NotChecked=230, Total=3660 [2024-11-14 04:13:39,006 INFO L87 Difference]: Start difference. First operand 202 states and 254 transitions. Second operand has 35 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 33 states have internal predecessors, (100), 17 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (28), 14 states have call predecessors, (28), 17 states have call successors, (28) [2024-11-14 04:13:41,429 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse23 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) (.cse56 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (.cse11 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 16)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse4 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| 0))) (.cse10 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (.cse57 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse0 (select (let ((.cse8 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (not (= (select .cse0 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_57 (Array Int Int)) (v_prenex_89 Int) (v_prenex_95 Int) (v_DerPreprocessor_102 Int) (v_DerPreprocessor_147 Int) (v_prenex_92 Int)) (let ((.cse3 (store v_arrayElimArr_57 v_prenex_89 v_DerPreprocessor_147))) (let ((.cse1 (store (store .cse3 v_prenex_92 v_DerPreprocessor_102) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (.cse2 (select (let ((.cse5 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (store (store v_arrayElimArr_57 v_prenex_89 (select .cse1 v_prenex_89)) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1)) (not (= (select .cse2 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= (select (store .cse3 v_prenex_92 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_89) v_DerPreprocessor_147)) (not (= (select .cse1 v_prenex_92) v_DerPreprocessor_102)) (not (= (select .cse2 .cse4) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_89))))))) (not (= (select .cse0 .cse4) 0))))))) (= (select .cse10 .cse11) 0) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse12 (select (let ((.cse16 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse16 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse16 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (not (= (select .cse12 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (not (= (select .cse12 .cse4) 0)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_57 (Array Int Int)) (v_prenex_89 Int) (v_DerPreprocessor_141 Int) (v_prenex_95 Int) (v_prenex_92 Int) (v_DerPreprocessor_95 Int)) (let ((.cse13 (select (let ((.cse15 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse15 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse15 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|)) (.cse14 (store (store (store v_arrayElimArr_57 v_prenex_89 v_DerPreprocessor_141) v_prenex_92 v_DerPreprocessor_95) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (or (= v_prenex_92 v_prenex_89) (not (= (select .cse13 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= (select .cse13 .cse4) 0)) (not (= (select .cse14 v_prenex_92) v_DerPreprocessor_95)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_89))) (not (= .cse14 (store (store v_arrayElimArr_57 v_prenex_89 (select .cse14 v_prenex_89)) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))))))))))) (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse17 (select (let ((.cse20 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse20 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse20 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (not (= (select .cse17 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_57 (Array Int Int)) (v_DerPreprocessor_122 Int) (v_prenex_92 Int) (v_subst_20 Int)) (let ((.cse18 (select (let ((.cse19 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse19 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse19 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (select (store (store v_arrayElimArr_57 v_prenex_92 v_DerPreprocessor_122) v_subst_20 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_92) v_DerPreprocessor_122)) (not (= (select .cse18 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_92))) (not (= (select .cse18 .cse4) 0))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (not (= (select .cse17 .cse4) 0))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int)) (or (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_94 (Array Int Int)) (v_prenex_93 Int)) (not (= (select (select (let ((.cse21 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_94))) (store .cse21 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse21 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_93))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse4) 0))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (forall ((v_DerPreprocessor_129 Int) (v_subst_15 Int) (v_ArrVal_1306 (Array Int Int)) (v_prenex_92 Int) (v_arrayElimArr_61 (Array Int Int))) (let ((.cse22 (select (let ((.cse24 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_61))) (store .cse24 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse24 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_61 v_prenex_92))) (not (= v_DerPreprocessor_129 (select (store (store v_arrayElimArr_61 v_prenex_92 v_DerPreprocessor_129) v_subst_15 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_92))) (= (select .cse22 .cse23) 0) (not (= (select .cse22 .cse4) 0))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse25 (select (let ((.cse29 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse29 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse29 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (not (= (select .cse25 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_57 (Array Int Int)) (v_prenex_89 Int) (v_subst_17 Int) (v_DerPreprocessor_143 Int) (v_prenex_92 Int) (v_DerPreprocessor_126 Int)) (let ((.cse26 (store (store v_arrayElimArr_57 v_prenex_89 v_DerPreprocessor_126) v_subst_17 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (.cse27 (select (let ((.cse28 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse28 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse28 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= v_prenex_92 v_prenex_89) (not (= (select .cse26 v_prenex_89) v_DerPreprocessor_126)) (not (= (select .cse27 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= (store (store (store v_arrayElimArr_57 v_prenex_89 v_DerPreprocessor_143) v_prenex_92 (select .cse26 v_prenex_92)) v_subst_17 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse26)) (not (= (select .cse27 .cse4) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_89)))))) (not (= (select .cse25 .cse4) 0))))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)))) (<= 1 |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse30 (select (let ((.cse35 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse35 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse35 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (not (= (select .cse30 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (not (= (select .cse30 .cse4) 0)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_57 (Array Int Int)) (v_prenex_89 Int) (v_subst_18 Int) (v_prenex_95 Int) (v_prenex_92 Int) (v_DerPreprocessor_115 Int) (v_DerPreprocessor_139 Int)) (let ((.cse31 (store v_arrayElimArr_57 v_prenex_89 v_DerPreprocessor_139)) (.cse32 (select (let ((.cse34 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse34 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse34 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (select (store .cse31 v_prenex_92 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_89) v_DerPreprocessor_139)) (= v_prenex_92 v_subst_18) (not (= (select .cse32 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (let ((.cse33 (store (store .cse31 v_prenex_92 (select (store (store .cse31 v_prenex_92 v_DerPreprocessor_115) v_subst_18 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_92)) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (= (store (store v_arrayElimArr_57 v_prenex_89 (select .cse33 v_prenex_89)) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse33))) (not (= (select .cse32 .cse4) 0)) (= v_prenex_95 v_prenex_92) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_89))))))))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse36 (select (let ((.cse39 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse39 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse39 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (not (= (select .cse36 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_57 (Array Int Int)) (v_prenex_92 Int)) (let ((.cse37 (select (let ((.cse38 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse38 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse38 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (select .cse37 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_92))) (not (= (select .cse37 .cse4) 0))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (not (= (select .cse36 .cse4) 0))))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse40 (select (let ((.cse45 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse45 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse45 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (not (= (select .cse40 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_57 (Array Int Int)) (v_subst_19 Int) (v_prenex_89 Int) (v_prenex_92 Int) (v_DerPreprocessor_149 Int) (v_DerPreprocessor_117 Int)) (let ((.cse42 (store v_arrayElimArr_57 v_prenex_89 v_DerPreprocessor_149)) (.cse41 (store (store v_arrayElimArr_57 v_prenex_89 v_DerPreprocessor_117) v_subst_19 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (.cse43 (select (let ((.cse44 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse44 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse44 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= v_DerPreprocessor_117 (select .cse41 v_prenex_89))) (not (= v_DerPreprocessor_149 (select (store .cse42 v_prenex_92 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_89))) (not (= (select .cse43 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= .cse41 (store (store .cse42 v_prenex_92 (select .cse41 v_prenex_92)) v_subst_19 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (not (= (select .cse43 .cse4) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_89)))))) (not (= (select .cse40 .cse4) 0))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)))) (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|) (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) (or (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 0)) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)) (forall ((v_ArrVal_1307 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_87 Int) (v_prenex_88 (Array Int Int))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (not (= (select (select (let ((.cse46 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_88))) (store .cse46 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse46 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_87))) 0) 16) 0)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_59 (Array Int Int)) (v_prenex_86 Int)) (or (not (= (select v_arrayElimArr_59 v_prenex_86) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (not (= (select (select (let ((.cse47 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_59))) (store .cse47 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse47 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) 0) 16) 0)))))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)) (forall ((v_ArrVal_1307 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_87 Int) (v_prenex_88 (Array Int Int))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_59 (Array Int Int)) (v_DerPreprocessor_93 Int) (v_prenex_95 Int) (v_prenex_86 Int) (v_DerPreprocessor_135 Int) (v_prenex_92 Int)) (let ((.cse48 (store v_arrayElimArr_59 v_prenex_86 v_DerPreprocessor_135))) (let ((.cse49 (store (store .cse48 v_prenex_92 v_DerPreprocessor_93) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (or (not (= v_DerPreprocessor_135 (select (store .cse48 v_prenex_92 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_86))) (not (= v_DerPreprocessor_93 (select .cse49 v_prenex_92))) (not (= (select v_arrayElimArr_59 v_prenex_86) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (not (= (select (select (let ((.cse50 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_59))) (store .cse50 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse50 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) 0) 16) 0)) (not (= .cse49 (store (store v_arrayElimArr_59 v_prenex_86 (select .cse49 v_prenex_86)) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (not (= (select (select (let ((.cse51 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_88))) (store .cse51 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse51 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_87))) 0) 16) 0)))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)) (forall ((v_ArrVal_1307 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_87 Int) (v_prenex_88 (Array Int Int))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (forall ((v_ArrVal_1306 (Array Int Int)) (v_subst_13 Int) (v_arrayElimArr_59 (Array Int Int)) (v_DerPreprocessor_133 Int) (v_prenex_95 Int) (v_prenex_86 Int) (v_DerPreprocessor_113 Int) (v_prenex_92 Int)) (let ((.cse53 (store v_arrayElimArr_59 v_prenex_86 v_DerPreprocessor_133))) (or (not (= (select v_arrayElimArr_59 v_prenex_86) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (not (let ((.cse52 (store (store .cse53 v_prenex_92 (select (store (store .cse53 v_prenex_92 v_DerPreprocessor_113) v_subst_13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_92)) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (= .cse52 (store (store v_arrayElimArr_59 v_prenex_86 (select .cse52 v_prenex_86)) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (not (= (select (select (let ((.cse54 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_59))) (store .cse54 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse54 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) 0) 16) 0)) (= v_prenex_95 v_prenex_92) (not (= (select (store .cse53 v_prenex_92 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_86) v_DerPreprocessor_133)) (= v_prenex_92 v_subst_13)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (not (= (select (select (let ((.cse55 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_88))) (store .cse55 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse55 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_87))) 0) 16) 0)))))))) (= (select .cse56 .cse57) 0) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse58 (select (let ((.cse63 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse63 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse63 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (not (= (select .cse58 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_DerPreprocessor_119 Int) (v_arrayElimArr_57 (Array Int Int)) (v_prenex_89 Int) (v_subst_16 Int) (v_prenex_95 Int) (v_DerPreprocessor_145 Int) (v_prenex_92 Int)) (let ((.cse59 (select (let ((.cse62 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse62 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse62 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= v_prenex_92 v_prenex_89) (not (= (select .cse59 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (let ((.cse60 (store (let ((.cse61 (store v_arrayElimArr_57 v_prenex_89 v_DerPreprocessor_145))) (store .cse61 v_prenex_92 (select (store (store .cse61 v_prenex_92 v_DerPreprocessor_119) v_subst_16 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_92))) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (= .cse60 (store (store v_arrayElimArr_57 v_prenex_89 (select .cse60 v_prenex_89)) v_prenex_95 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (not (= (select .cse59 .cse4) 0)) (= v_prenex_95 v_prenex_92) (= v_prenex_92 v_subst_16) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_89)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (not (= (select .cse58 .cse4) 0))))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_prenex_95 Int) (v_arrayElimArr_60 (Array Int Int))) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_60 v_prenex_95))) (not (= (select (select (let ((.cse64 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_60))) (store .cse64 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse64 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse4) 0)))) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_97 (Array Int Int)) (v_prenex_96 Int)) (let ((.cse65 (select (let ((.cse66 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_97))) (store .cse66 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse66 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_96))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (select .cse65 .cse4) 0)) (= (select .cse65 .cse23) 0)))))))) (= (select .cse56 .cse11) 0) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int)) (let ((.cse68 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1311 (Array Int Int))) (let ((.cse67 (select (let ((.cse69 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_ArrVal_1311))) (store .cse69 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse69 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_ArrVal_1310))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (select .cse67 .cse68) 0)) (not (= (select .cse67 .cse4) 0))))) (forall ((v_subst_14 Int) (v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_58 (Array Int Int))) (let ((.cse70 (select (let ((.cse71 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_58))) (store .cse71 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse71 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (select .cse70 .cse68) 0)) (not (= 0 (select .cse70 .cse4))) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_58 v_subst_14)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)))) (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| Int)) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| 1)) (forall ((v_ArrVal_1307 (Array Int Int)) (v_prenex_90 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| Int) (v_prenex_91 (Array Int Int))) (let ((.cse74 (select (let ((.cse75 (store (store .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1307) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_prenex_91))) (store .cse75 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse75 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 v_prenex_90))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 0) (forall ((v_ArrVal_1306 (Array Int Int)) (v_arrayElimArr_57 (Array Int Int)) (v_DerPreprocessor_89 Int) (v_prenex_86 Int) (v_prenex_92 Int)) (let ((.cse72 (select (let ((.cse73 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_54| v_ArrVal_1306) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| v_arrayElimArr_57))) (store .cse73 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse73 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (not (= (select .cse72 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_57 v_prenex_92))) (not (= (select .cse72 .cse4) 0)) (not (= v_DerPreprocessor_89 (select (store (store v_arrayElimArr_57 v_prenex_92 v_DerPreprocessor_89) v_prenex_86 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_prenex_92)))))) (not (= (select .cse74 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_53| 1)) (not (= (select .cse74 .cse4) 0))))))) (= (select .cse10 .cse57) 0))) is different from true [2024-11-14 04:13:53,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:13:53,795 INFO L93 Difference]: Finished difference Result 426 states and 545 transitions. [2024-11-14 04:13:53,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-14 04:13:53,795 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 33 states have internal predecessors, (100), 17 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (28), 14 states have call predecessors, (28), 17 states have call successors, (28) Word has length 66 [2024-11-14 04:13:53,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:13:53,797 INFO L225 Difference]: With dead ends: 426 [2024-11-14 04:13:53,797 INFO L226 Difference]: Without dead ends: 242 [2024-11-14 04:13:53,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 144 SyntacticMatches, 16 SemanticMatches, 82 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2384 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=451, Invalid=6033, Unknown=8, NotChecked=480, Total=6972 [2024-11-14 04:13:53,801 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 125 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 355 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:13:53,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 553 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1212 Invalid, 0 Unknown, 355 Unchecked, 6.9s Time] [2024-11-14 04:13:53,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-14 04:13:53,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 203. [2024-11-14 04:13:53,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 135 states have (on average 1.1777777777777778) internal successors, (159), 144 states have internal predecessors, (159), 44 states have call successors, (44), 17 states have call predecessors, (44), 23 states have return successors, (47), 41 states have call predecessors, (47), 41 states have call successors, (47) [2024-11-14 04:13:53,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 250 transitions. [2024-11-14 04:13:53,928 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 250 transitions. Word has length 66 [2024-11-14 04:13:53,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:13:53,928 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 250 transitions. [2024-11-14 04:13:53,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 33 states have internal predecessors, (100), 17 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (28), 14 states have call predecessors, (28), 17 states have call successors, (28) [2024-11-14 04:13:53,928 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 250 transitions. [2024-11-14 04:13:53,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-14 04:13:53,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:13:53,930 INFO L215 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 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-14 04:13:53,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-14 04:13:54,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:13:54,131 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:13:54,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:13:54,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1623446300, now seen corresponding path program 1 times [2024-11-14 04:13:54,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:13:54,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955357686] [2024-11-14 04:13:54,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:13:54,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:13:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:13:54,672 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-14 04:13:54,672 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:13:54,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955357686] [2024-11-14 04:13:54,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955357686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:13:54,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:13:54,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 04:13:54,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914789539] [2024-11-14 04:13:54,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:13:54,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 04:13:54,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:13:54,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 04:13:54,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:13:54,674 INFO L87 Difference]: Start difference. First operand 203 states and 250 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-14 04:13:55,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:13:55,044 INFO L93 Difference]: Finished difference Result 235 states and 287 transitions. [2024-11-14 04:13:55,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 04:13:55,045 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 70 [2024-11-14 04:13:55,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:13:55,048 INFO L225 Difference]: With dead ends: 235 [2024-11-14 04:13:55,049 INFO L226 Difference]: Without dead ends: 233 [2024-11-14 04:13:55,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-14 04:13:55,050 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 3 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:13:55,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 284 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:13:55,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-14 04:13:55,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2024-11-14 04:13:55,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 153 states have (on average 1.1568627450980393) internal successors, (177), 165 states have internal predecessors, (177), 47 states have call successors, (47), 20 states have call predecessors, (47), 29 states have return successors, (56), 44 states have call predecessors, (56), 44 states have call successors, (56) [2024-11-14 04:13:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 280 transitions. [2024-11-14 04:13:55,210 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 280 transitions. Word has length 70 [2024-11-14 04:13:55,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:13:55,212 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 280 transitions. [2024-11-14 04:13:55,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-14 04:13:55,212 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 280 transitions. [2024-11-14 04:13:55,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-14 04:13:55,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:13:55,219 INFO L215 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-14 04:13:55,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 04:13:55,219 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:13:55,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:13:55,220 INFO L85 PathProgramCache]: Analyzing trace with hash 120240671, now seen corresponding path program 2 times [2024-11-14 04:13:55,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:13:55,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420999608] [2024-11-14 04:13:55,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:13:55,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:13:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:13:57,217 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 9 proven. 45 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-14 04:13:57,217 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:13:57,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420999608] [2024-11-14 04:13:57,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420999608] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:13:57,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224673898] [2024-11-14 04:13:57,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 04:13:57,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:13:57,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:13:57,219 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:13:57,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-14 04:13:57,625 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 04:13:57,625 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:13:57,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-14 04:13:57,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:13:57,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-14 04:13:57,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-14 04:14:13,160 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 57 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 04:14:13,160 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:14:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 35 proven. 21 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-14 04:14:14,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224673898] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:14:14,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [84936649] [2024-11-14 04:14:14,395 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2024-11-14 04:14:14,396 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:14:14,396 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:14:14,396 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:14:14,396 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:14:16,162 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 46 for LOIs [2024-11-14 04:14:16,184 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 17 for LOIs [2024-11-14 04:14:16,340 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 12 for LOIs [2024-11-14 04:14:16,342 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 95 for LOIs [2024-11-14 04:14:16,354 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 25 for LOIs [2024-11-14 04:14:16,391 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:14:33,006 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '11754#(and (<= 1 |#StackHeapBarrier|) (= |~#s_can_fail_allocator_static~0.base| 4) (= |~#s_can_fail_allocator_static~0.offset| 0) (= ~tl_last_error~0 0) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#res#1_73| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_105| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_#t~ret334#1_BEFORE_CALL_4| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_rbegin_#t~ret334#1_BEFORE_CALL_4| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_105| 0) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#res#1_73| 0) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#t~ret322#1_138| Int)) (= (mod |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#t~ret322#1_138| 256) 0)))))' at error location [2024-11-14 04:14:33,006 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:14:33,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:14:33,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 13] total 38 [2024-11-14 04:14:33,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206239786] [2024-11-14 04:14:33,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:14:33,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-14 04:14:33,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:14:33,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-14 04:14:33,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=3708, Unknown=10, NotChecked=0, Total=4032 [2024-11-14 04:14:33,010 INFO L87 Difference]: Start difference. First operand 230 states and 280 transitions. Second operand has 38 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 19 states have call successors, (32), 4 states have call predecessors, (32), 8 states have return successors, (32), 17 states have call predecessors, (32), 18 states have call successors, (32) [2024-11-14 04:14:35,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:14:37,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:14:39,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:14:41,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:14:43,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:14:47,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:14:52,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:14:56,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:00,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:04,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:06,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:08,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:10,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:12,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:14,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:18,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:20,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:22,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:24,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:26,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:28,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:30,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:32,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:35,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:37,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:39,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:43,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:45,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:47,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:49,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:51,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:53,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:55,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:57,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:59,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:01,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:03,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:07,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:09,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:11,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:13,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:15,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:17,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:19,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:21,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:23,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:25,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:27,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:29,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:31,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:33,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:35,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:37,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:39,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:41,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:50,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:52,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:54,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:56,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:58,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:17:00,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:17:02,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:17:04,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:17:06,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:17:08,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:17:10,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:17:12,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:17:14,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:17:16,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:17:18,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:17:20,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:17:22,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:17:22,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:17:22,727 INFO L93 Difference]: Finished difference Result 555 states and 682 transitions. [2024-11-14 04:17:22,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-14 04:17:22,728 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 19 states have call successors, (32), 4 states have call predecessors, (32), 8 states have return successors, (32), 17 states have call predecessors, (32), 18 states have call successors, (32) Word has length 73 [2024-11-14 04:17:22,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:17:22,730 INFO L225 Difference]: With dead ends: 555 [2024-11-14 04:17:22,730 INFO L226 Difference]: Without dead ends: 427 [2024-11-14 04:17:22,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 176 SyntacticMatches, 9 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2432 ImplicationChecksByTransitivity, 55.5s TimeCoverageRelationStatistics Valid=554, Invalid=5905, Unknown=21, NotChecked=0, Total=6480 [2024-11-14 04:17:22,733 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 120 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 89 mSolverCounterUnsat, 72 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 146.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 72 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 146.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:17:22,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 805 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1446 Invalid, 72 Unknown, 0 Unchecked, 146.5s Time] [2024-11-14 04:17:22,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-14 04:17:22,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 383. [2024-11-14 04:17:22,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 259 states have (on average 1.138996138996139) internal successors, (295), 273 states have internal predecessors, (295), 76 states have call successors, (76), 36 states have call predecessors, (76), 47 states have return successors, (90), 73 states have call predecessors, (90), 71 states have call successors, (90) [2024-11-14 04:17:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 461 transitions. [2024-11-14 04:17:22,915 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 461 transitions. Word has length 73 [2024-11-14 04:17:22,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:17:22,916 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 461 transitions. [2024-11-14 04:17:22,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 19 states have call successors, (32), 4 states have call predecessors, (32), 8 states have return successors, (32), 17 states have call predecessors, (32), 18 states have call successors, (32) [2024-11-14 04:17:22,916 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 461 transitions. [2024-11-14 04:17:22,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-14 04:17:22,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:17:22,918 INFO L215 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-14 04:17:22,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-14 04:17:23,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:17:23,119 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:17:23,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:17:23,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1435901082, now seen corresponding path program 1 times [2024-11-14 04:17:23,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:17:23,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748715888] [2024-11-14 04:17:23,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:17:23,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:17:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:17:23,477 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-14 04:17:23,478 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:17:23,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748715888] [2024-11-14 04:17:23,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748715888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:17:23,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:17:23,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 04:17:23,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084608312] [2024-11-14 04:17:23,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:17:23,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:17:23,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:17:23,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:17:23,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:17:23,480 INFO L87 Difference]: Start difference. First operand 383 states and 461 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-14 04:17:23,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:17:23,832 INFO L93 Difference]: Finished difference Result 405 states and 482 transitions. [2024-11-14 04:17:23,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:17:23,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 76 [2024-11-14 04:17:23,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:17:23,835 INFO L225 Difference]: With dead ends: 405 [2024-11-14 04:17:23,835 INFO L226 Difference]: Without dead ends: 403 [2024-11-14 04:17:23,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:17:23,836 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 3 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:17:23,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 208 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:17:23,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-14 04:17:24,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2024-11-14 04:17:24,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 274 states have (on average 1.1313868613138687) internal successors, (310), 288 states have internal predecessors, (310), 76 states have call successors, (76), 41 states have call predecessors, (76), 52 states have return successors, (90), 73 states have call predecessors, (90), 71 states have call successors, (90) [2024-11-14 04:17:24,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 476 transitions. [2024-11-14 04:17:24,004 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 476 transitions. Word has length 76 [2024-11-14 04:17:24,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:17:24,004 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 476 transitions. [2024-11-14 04:17:24,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-14 04:17:24,004 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 476 transitions. [2024-11-14 04:17:24,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-14 04:17:24,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:17:24,007 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 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] [2024-11-14 04:17:24,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 04:17:24,007 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:17:24,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:17:24,007 INFO L85 PathProgramCache]: Analyzing trace with hash 2116445605, now seen corresponding path program 1 times [2024-11-14 04:17:24,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:17:24,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256223914] [2024-11-14 04:17:24,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:17:24,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:17:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:17:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-14 04:17:25,194 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:17:25,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256223914] [2024-11-14 04:17:25,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256223914] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:17:25,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311225931] [2024-11-14 04:17:25,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:17:25,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:17:25,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:17:25,197 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:17:25,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ccb862b-ff8d-478b-98d3-004632a91aad/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-14 04:17:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:17:25,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-14 04:17:25,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:17:25,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-14 04:17:25,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-14 04:17:41,786 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 62 proven. 4 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-14 04:17:41,786 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:17:42,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 174 [2024-11-14 04:17:42,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:17:42,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:17:42,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2024-11-14 04:17:42,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 04:17:42,675 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 04:17:42,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-14 04:17:42,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 04:17:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-14 04:17:42,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311225931] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:17:42,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [931262443] [2024-11-14 04:17:42,834 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2024-11-14 04:17:42,835 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:17:42,835 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:17:42,835 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:17:42,835 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:17:44,856 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 56 for LOIs [2024-11-14 04:17:44,886 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 17 for LOIs [2024-11-14 04:17:45,077 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 12 for LOIs [2024-11-14 04:17:45,079 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 95 for LOIs [2024-11-14 04:17:45,087 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 25 for LOIs [2024-11-14 04:17:45,105 INFO L180 IcfgInterpreter]: Interpretation finished