./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_rend_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_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/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_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/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_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/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 ec13cd31cb83ba576938e580d51fea49ff46ac6b1d457f8e4c2fd8b2dcc85ee1 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:20:46,074 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:20:46,134 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-64bit-Taipan_Default.epf [2024-11-14 04:20:46,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:20:46,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:20:46,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:20:46,181 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:20:46,181 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:20:46,182 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:20:46,182 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:20:46,182 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:20:46,182 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:20:46,182 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:20:46,182 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:20:46,183 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:20:46,183 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:20:46,184 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:20:46,185 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:20:46,185 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:20:46,186 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:20:46,186 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:20:46,186 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:20:46,186 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:20:46,186 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:20:46,186 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:20:46,186 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:20:46,186 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:20:46,187 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:20:46,187 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:20:46,187 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:20:46,187 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:20:46,187 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:20:46,187 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:20:46,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:20:46,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:20:46,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:20:46,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:20:46,187 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:20:46,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:20:46,188 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:20:46,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:20:46,188 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:20:46,188 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:20:46,188 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:20:46,188 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_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/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 -> ec13cd31cb83ba576938e580d51fea49ff46ac6b1d457f8e4c2fd8b2dcc85ee1 [2024-11-14 04:20:46,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:20:46,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:20:46,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:20:46,548 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:20:46,549 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:20:46,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i Unable to find full path for "g++" [2024-11-14 04:20:48,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:20:49,106 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:20:49,107 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i [2024-11-14 04:20:49,151 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/data/75edfed18/c6217aa67bbc4a5b9a0b1d89e5572983/FLAG045389e1e [2024-11-14 04:20:49,185 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/data/75edfed18/c6217aa67bbc4a5b9a0b1d89e5572983 [2024-11-14 04:20:49,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:20:49,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:20:49,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:20:49,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:20:49,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:20:49,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:20:49" (1/1) ... [2024-11-14 04:20:49,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b26244b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:49, skipping insertion in model container [2024-11-14 04:20:49,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:20:49" (1/1) ... [2024-11-14 04:20:49,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:20:49,701 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_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i[4494,4507] [2024-11-14 04:20:49,709 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_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i[4554,4567] [2024-11-14 04:20:50,753 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:50,754 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:50,755 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:50,756 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:50,757 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:50,775 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:50,776 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:50,779 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:50,780 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:50,782 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:50,783 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:50,784 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:50,785 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:51,528 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_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i[150464,150477] [2024-11-14 04:20:51,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:20:51,553 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:20:51,585 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_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i[4494,4507] [2024-11-14 04:20:51,585 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_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i[4554,4567] [2024-11-14 04:20:51,733 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:51,733 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:51,734 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:51,734 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:51,739 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:51,761 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:51,762 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:51,765 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:51,766 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:51,769 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:51,770 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:51,771 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:51,771 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:20:51,953 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_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i[150464,150477] [2024-11-14 04:20:51,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:20:52,205 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:20:52,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:52 WrapperNode [2024-11-14 04:20:52,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:20:52,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:20:52,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:20:52,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:20:52,217 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:20:52" (1/1) ... [2024-11-14 04:20:52,312 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:20:52" (1/1) ... [2024-11-14 04:20:52,369 INFO L138 Inliner]: procedures = 668, calls = 1038, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 135 [2024-11-14 04:20:52,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:20:52,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:20:52,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:20:52,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:20:52,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:52" (1/1) ... [2024-11-14 04:20:52,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:52" (1/1) ... [2024-11-14 04:20:52,383 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:52" (1/1) ... [2024-11-14 04:20:52,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:52" (1/1) ... [2024-11-14 04:20:52,397 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:52" (1/1) ... [2024-11-14 04:20:52,401 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:52" (1/1) ... [2024-11-14 04:20:52,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:52" (1/1) ... [2024-11-14 04:20:52,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:52" (1/1) ... [2024-11-14 04:20:52,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:20:52,412 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:20:52,412 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:20:52,412 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:20:52,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:52" (1/1) ... [2024-11-14 04:20:52,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:20:52,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:20:52,463 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/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:20:52,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/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:20:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 04:20:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-14 04:20:52,510 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-14 04:20:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-14 04:20:52,511 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-14 04:20:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 04:20:52,512 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-14 04:20:52,512 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-14 04:20:52,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:20:52,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 04:20:52,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:20:52,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:20:52,512 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 04:20:52,512 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 04:20:52,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 04:20:52,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 04:20:52,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 04:20:52,513 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-14 04:20:52,513 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-14 04:20:52,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:20:52,844 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:20:52,848 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:20:53,290 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-11-14 04:20:53,293 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:20:53,497 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:20:53,497 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-14 04:20:53,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:20:53 BoogieIcfgContainer [2024-11-14 04:20:53,498 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:20:53,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:20:53,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:20:53,507 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:20:53,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:20:49" (1/3) ... [2024-11-14 04:20:53,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df82ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:20:53, skipping insertion in model container [2024-11-14 04:20:53,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:20:52" (2/3) ... [2024-11-14 04:20:53,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df82ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:20:53, skipping insertion in model container [2024-11-14 04:20:53,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:20:53" (3/3) ... [2024-11-14 04:20:53,511 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rend_harness.i [2024-11-14 04:20:53,531 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:20:53,533 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_rend_harness.i that has 6 procedures, 45 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-14 04:20:53,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:20:53,626 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;@58d62b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:20:53,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 04:20:53,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 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:20:53,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 04:20:53,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:20:53,642 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:20:53,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:20:53,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:20:53,648 INFO L85 PathProgramCache]: Analyzing trace with hash 171939848, now seen corresponding path program 1 times [2024-11-14 04:20:53,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:20:53,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150725401] [2024-11-14 04:20:53,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:20:53,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:20:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:20:55,297 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:20:55,299 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:20:55,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150725401] [2024-11-14 04:20:55,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150725401] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:20:55,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425030430] [2024-11-14 04:20:55,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:20:55,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:20:55,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:20:55,306 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:20:55,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 04:20:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:20:55,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-14 04:20:55,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:20:55,997 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:20:56,022 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:20:56,211 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 33 treesize of output 28 [2024-11-14 04:20:56,252 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:20:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:20:59,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:20:59,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425030430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:20:59,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:20:59,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2024-11-14 04:20:59,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181301983] [2024-11-14 04:20:59,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:20:59,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 04:20:59,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:20:59,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 04:20:59,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-14 04:20:59,322 INFO L87 Difference]: Start difference. First operand has 45 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 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, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-14 04:21:00,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:21:00,309 INFO L93 Difference]: Finished difference Result 121 states and 170 transitions. [2024-11-14 04:21:00,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 04:21:00,312 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 37 [2024-11-14 04:21:00,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:21:00,322 INFO L225 Difference]: With dead ends: 121 [2024-11-14 04:21:00,322 INFO L226 Difference]: Without dead ends: 79 [2024-11-14 04:21:00,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-14 04:21:00,332 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 32 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:21:00,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 310 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 04:21:00,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-14 04:21:00,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2024-11-14 04:21:00,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 43 states have (on average 1.302325581395349) internal successors, (56), 45 states have internal predecessors, (56), 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:21:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 102 transitions. [2024-11-14 04:21:00,414 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 102 transitions. Word has length 37 [2024-11-14 04:21:00,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:21:00,415 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 102 transitions. [2024-11-14 04:21:00,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-14 04:21:00,416 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2024-11-14 04:21:00,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-14 04:21:00,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:21:00,418 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:21:00,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 04:21:00,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-14 04:21:00,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:21:00,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:21:00,620 INFO L85 PathProgramCache]: Analyzing trace with hash 626265936, now seen corresponding path program 1 times [2024-11-14 04:21:00,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:21:00,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399832933] [2024-11-14 04:21:00,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:21:00,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:21:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:21:01,240 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 04:21:01,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:21:01,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399832933] [2024-11-14 04:21:01,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399832933] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:21:01,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963038656] [2024-11-14 04:21:01,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:21:01,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:21:01,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:21:01,243 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:21:01,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 04:21:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:21:01,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-14 04:21:01,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:21:01,654 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:21:01,677 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:21:01,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:21:01,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:21:01,789 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:21:01,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:21:01,801 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:21:01,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:21:01,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:21:01,828 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:21:01,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:21:01,843 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 27 treesize of output 20 [2024-11-14 04:21:02,080 INFO L349 Elim1Store]: treesize reduction 135, result has 16.1 percent of original size [2024-11-14 04:21:02,080 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 168 treesize of output 96 [2024-11-14 04:21:02,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:21:02,115 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 25 [2024-11-14 04:21:04,926 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:21:04,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:21:13,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:21:13,288 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 388 treesize of output 473 [2024-11-14 04:21:15,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:21:15,332 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:21:15,881 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:21:15,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2024-11-14 04:21:16,017 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:21:16,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2024-11-14 04:21:16,180 INFO L224 Elim1Store]: Index analysis took 119 ms [2024-11-14 04:21:16,195 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:21:16,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2024-11-14 04:21:16,321 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:21:16,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2024-11-14 04:21:16,538 INFO L224 Elim1Store]: Index analysis took 139 ms [2024-11-14 04:21:16,556 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:21:16,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2024-11-14 04:21:16,813 INFO L224 Elim1Store]: Index analysis took 178 ms [2024-11-14 04:21:16,839 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:21:16,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2024-11-14 04:21:17,133 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:21:17,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2024-11-14 04:21:17,219 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:21:17,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2024-11-14 04:21:17,292 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:21:17,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2024-11-14 04:21:17,374 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:21:17,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2024-11-14 04:21:17,440 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:21:17,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2024-11-14 04:21:17,557 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:21:17,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2024-11-14 04:21:18,068 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:21:18,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 19 [2024-11-14 04:21:18,127 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:21:18,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 19 [2024-11-14 04:21:18,207 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:21:18,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 19 [2024-11-14 04:21:18,306 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:21:18,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 19 [2024-11-14 04:21:18,402 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:21:18,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 19 [2024-11-14 04:21:20,993 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 04:21:20,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 1 [2024-11-14 04:21:21,522 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:21:21,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 19 [2024-11-14 04:21:22,176 INFO L349 Elim1Store]: treesize reduction 73, result has 7.6 percent of original size [2024-11-14 04:21:22,176 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 124 treesize of output 109 [2024-11-14 04:21:23,730 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 16 |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|)) (.cse10 (+ 8 |c_ULTIMATE.start_aws_linked_list_rend_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|)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset| 24))) (and (or (not (= |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_rend_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_arrayElimArr_8 (Array Int Int)) (v_DerPreprocessor_55 Int) (v_subst_5 Int) (v_subst_3 Int) (v_DerPreprocessor_53 Int) (v_subst_1 Int)) (or (= v_subst_5 v_subst_1) (not (= v_DerPreprocessor_53 (select (store (store (store v_arrayElimArr_8 v_subst_3 v_DerPreprocessor_53) v_subst_5 (select v_arrayElimArr_8 v_subst_5)) v_subst_1 v_DerPreprocessor_55) v_subst_3))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |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_8))) (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_20|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse3) 0) (= v_subst_5 v_subst_3))) (= |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_arrayElimArr_10 (Array Int Int)) (v_DerPreprocessor_44 Int) (v_ArrVal_178 Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_7 Int) (v_subst_5 Int) (v_subst_3 Int) (v_subst_1 Int) (v_DerPreprocessor_43 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (let ((.cse5 (store v_arrayElimArr_10 v_subst_1 v_DerPreprocessor_43))) (let ((.cse4 (store (store .cse5 v_subst_5 v_DerPreprocessor_7) v_subst_3 v_DerPreprocessor_8))) (or (not (= v_DerPreprocessor_7 (select .cse4 v_subst_5))) (not (= .cse4 (store (store v_arrayElimArr_10 v_subst_1 (select .cse4 v_subst_1)) v_subst_3 v_DerPreprocessor_8))) (not (= v_DerPreprocessor_43 (select (store .cse5 v_subst_5 v_DerPreprocessor_44) v_subst_1))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |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_ArrVal_178)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_6) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse7) 0)) (not (= v_DerPreprocessor_1 (select (store (store v_arrayElimArr_6 v_subst_1 v_DerPreprocessor_1) v_subst_5 v_DerPreprocessor_2) v_subst_1))) (not (= (select (select (let ((.cse8 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |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_10))) (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_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse7) 0)))))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (forall ((v_arrayElimArr_9 (Array Int Int))) (= (select (select (let ((.cse9 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |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_9))) (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_20|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse10) 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_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_DerPreprocessor_35 Int) (v_arrayElimArr_5 (Array Int Int)) (v_DerPreprocessor_36 Int) (v_arrayElimArr_7 (Array Int Int)) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_37 Int) (v_DerPreprocessor_16 Int) (v_DerPreprocessor_38 Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_4 Int) (v_subst_3 Int) (v_subst_1 Int) (v_DerPreprocessor_51 Int) (v_DerPreprocessor_52 Int) (v_ArrVal_178 Int)) (let ((.cse12 (store v_arrayElimArr_7 v_subst_5 v_DerPreprocessor_51)) (.cse14 (store (store v_arrayElimArr_7 v_subst_5 v_DerPreprocessor_15) v_subst_3 v_DerPreprocessor_16)) (.cse13 (store (store v_arrayElimArr_5 v_subst_5 v_DerPreprocessor_35) v_subst_6 v_DerPreprocessor_36)) (.cse15 (store v_arrayElimArr_5 v_subst_5 v_DerPreprocessor_37))) (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 .cse2 |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_7))) (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_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |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_ArrVal_178)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_5) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|) 0)) (not (= (select (store .cse12 v_subst_1 v_DerPreprocessor_52) v_subst_5) v_DerPreprocessor_51)) (not (= v_DerPreprocessor_35 (select .cse13 v_subst_5))) (not (= (store (store .cse12 v_subst_1 (select .cse14 v_subst_1)) v_subst_3 v_DerPreprocessor_16) .cse14)) (not (= v_DerPreprocessor_15 (select .cse14 v_subst_5))) (not (= (store (store .cse15 v_subst_4 (select .cse13 v_subst_4)) v_subst_6 v_DerPreprocessor_36) .cse13)) (not (= (select (store .cse15 v_subst_4 v_DerPreprocessor_38) v_subst_5) v_DerPreprocessor_37))))) (= |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_DerPreprocessor_24 Int) (v_DerPreprocessor_25 Int) (v_ArrVal_178 Int) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int)) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |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_ArrVal_178)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_3) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse3) 0) (not (= (select (store (store v_arrayElimArr_3 v_subst_4 v_DerPreprocessor_24) v_subst_6 v_DerPreprocessor_25) v_subst_4) v_DerPreprocessor_24)))) (= |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_10 (Array Int Int))) (or (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_18 Int) (v_DerPreprocessor_60 Int) (v_subst_5 Int) (v_DerPreprocessor_61 Int) (v_subst_3 Int) (v_subst_1 Int)) (let ((.cse17 (store v_arrayElimArr_10 v_subst_5 v_DerPreprocessor_60)) (.cse16 (store (store v_arrayElimArr_10 v_subst_5 v_DerPreprocessor_17) v_subst_3 v_DerPreprocessor_18))) (or (not (= v_DerPreprocessor_17 (select .cse16 v_subst_5))) (not (= v_DerPreprocessor_60 (select (store .cse17 v_subst_1 v_DerPreprocessor_61) v_subst_5))) (not (= (store (store .cse17 v_subst_1 (select .cse16 v_subst_1)) v_subst_3 v_DerPreprocessor_18) .cse16)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_178 Int) (v_subst_6 Int) (v_subst_4 Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_32 Int) (v_DerPreprocessor_30 Int)) (let ((.cse18 (store (store (store v_arrayElimArr_6 v_subst_5 v_DerPreprocessor_30) v_subst_4 v_DerPreprocessor_31) v_subst_6 v_DerPreprocessor_32))) (or (= v_subst_6 v_subst_5) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |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_ArrVal_178)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_6) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse7) 0)) (not (= (store (store v_arrayElimArr_6 v_subst_5 (select .cse18 v_subst_5)) v_subst_6 v_DerPreprocessor_32) .cse18)) (not (= v_DerPreprocessor_31 (select .cse18 v_subst_4))) (= v_subst_5 v_subst_4))))))) (not (= (select (select (let ((.cse19 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |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_10))) (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|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse7) 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_6 (Array Int Int)) (v_arrayElimArr_10 (Array Int Int)) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_12 Int) (v_DerPreprocessor_39 Int) (v_subst_6 Int) (v_subst_5 Int) (v_DerPreprocessor_72 Int) (v_subst_4 Int) (v_subst_3 Int) (v_subst_2 Int) (v_subst_1 Int) (v_DerPreprocessor_40 Int) (v_DerPreprocessor_73 Int) (v_DerPreprocessor_41 Int) (v_DerPreprocessor_74 Int) (v_ArrVal_178 Int)) (let ((.cse23 (store v_arrayElimArr_10 v_subst_2 v_DerPreprocessor_74))) (let ((.cse24 (store (store v_arrayElimArr_10 v_subst_2 v_DerPreprocessor_72) v_subst_1 v_DerPreprocessor_73)) (.cse20 (store (store v_arrayElimArr_6 v_subst_2 v_DerPreprocessor_39) v_subst_6 v_DerPreprocessor_40)) (.cse21 (store (store .cse23 v_subst_5 v_DerPreprocessor_11) v_subst_3 v_DerPreprocessor_12))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |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_ArrVal_178)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_6) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse7) 0)) (not (= .cse20 (store (store (store v_arrayElimArr_6 v_subst_2 v_DerPreprocessor_41) v_subst_4 (select .cse20 v_subst_4)) v_subst_6 v_DerPreprocessor_40))) (not (= (select .cse21 v_subst_5) v_DerPreprocessor_11)) (not (= (select (select (let ((.cse22 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |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_10))) (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|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse7) 0)) (not (= (store (store .cse23 v_subst_5 (select .cse24 v_subst_5)) v_subst_1 v_DerPreprocessor_73) .cse24)) (not (= (select .cse24 v_subst_2) v_DerPreprocessor_72)) (= v_subst_5 v_subst_2) (= v_subst_4 v_subst_2) (not (= v_DerPreprocessor_39 (select .cse20 v_subst_2))) (not (= .cse21 (store (store v_arrayElimArr_10 v_subst_2 (select .cse21 v_subst_2)) v_subst_3 v_DerPreprocessor_12))))))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 0))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_178 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |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_ArrVal_178)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_6) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse7) 0)) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_DerPreprocessor_66 Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_7 Int) (v_subst_5 Int) (v_subst_3 Int) (v_subst_1 Int)) (let ((.cse25 (store (store (store v_arrayElimArr_10 v_subst_1 v_DerPreprocessor_66) v_subst_5 v_DerPreprocessor_7) v_subst_3 v_DerPreprocessor_8))) (or (= v_subst_5 v_subst_1) (not (= .cse25 (store (store v_arrayElimArr_10 v_subst_1 (select .cse25 v_subst_1)) v_subst_3 v_DerPreprocessor_8))) (not (= (select (select (let ((.cse26 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |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_10))) (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_20|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse7) 0)) (not (= (select .cse25 v_subst_5) v_DerPreprocessor_7))))) (< |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_8 (Array Int Int)) (v_DerPreprocessor_55 Int) (v_subst_5 Int) (v_DerPreprocessor_54 Int) (v_subst_1 Int)) (or (not (= (select (store (store v_arrayElimArr_8 v_subst_5 v_DerPreprocessor_54) v_subst_1 v_DerPreprocessor_55) v_subst_5) v_DerPreprocessor_54)) (= (select (select (let ((.cse27 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |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_8))) (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_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse3) 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)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 0) (forall ((v_arrayElimArr_10 (Array Int Int))) (or (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_18 Int) (v_DerPreprocessor_60 Int) (v_subst_5 Int) (v_DerPreprocessor_61 Int) (v_subst_3 Int) (v_subst_1 Int)) (let ((.cse29 (store v_arrayElimArr_10 v_subst_5 v_DerPreprocessor_60)) (.cse28 (store (store v_arrayElimArr_10 v_subst_5 v_DerPreprocessor_17) v_subst_3 v_DerPreprocessor_18))) (or (not (= v_DerPreprocessor_17 (select .cse28 v_subst_5))) (not (= v_DerPreprocessor_60 (select (store .cse29 v_subst_1 v_DerPreprocessor_61) v_subst_5))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_178 Int) (v_DerPreprocessor_28 Int) (v_DerPreprocessor_29 Int) (v_subst_6 Int)) (or (not (= v_DerPreprocessor_28 (select (store (store v_arrayElimArr_6 v_subst_5 v_DerPreprocessor_28) v_subst_6 v_DerPreprocessor_29) v_subst_5))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |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_ArrVal_178)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_6) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse7) 0)))) (not (= (store (store .cse29 v_subst_1 (select .cse28 v_subst_1)) v_subst_3 v_DerPreprocessor_18) .cse28))))) (not (= (select (select (let ((.cse30 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |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_10))) (store .cse30 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse30 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse7) 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_ArrVal_178 Int)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |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_ArrVal_178)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_6) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse7) 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_DerPreprocessor_46 Int) (v_arrayElimArr_10 (Array Int Int)) (v_DerPreprocessor_45 Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_7 Int) (v_subst_5 Int) (v_subst_3 Int) (v_subst_1 Int)) (let ((.cse32 (store v_arrayElimArr_10 v_subst_5 v_DerPreprocessor_45)) (.cse31 (store (store v_arrayElimArr_10 v_subst_5 v_DerPreprocessor_7) v_subst_3 v_DerPreprocessor_8))) (or (not (= (select .cse31 v_subst_5) v_DerPreprocessor_7)) (not (= v_DerPreprocessor_45 (select (store .cse32 v_subst_1 v_DerPreprocessor_46) v_subst_5))) (not (= (select (select (let ((.cse33 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |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_10))) (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|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse7) 0)) (not (= .cse31 (store (store .cse32 v_subst_1 (select .cse31 v_subst_1)) v_subst_3 v_DerPreprocessor_8)))))))) (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_8 (Array Int Int)) (v_subst_3 Int) (v_DerPreprocessor_53 Int) (v_subst_1 Int) (v_DerPreprocessor_54 Int)) (or (= (select (select (let ((.cse34 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |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_8))) (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|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse3) 0) (not (= v_DerPreprocessor_53 (select (store (store v_arrayElimArr_8 v_subst_3 v_DerPreprocessor_53) v_subst_1 v_DerPreprocessor_54) v_subst_3))))))) (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_DerPreprocessor_57 Int) (v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_10 (Array Int Int)) (v_DerPreprocessor_58 Int) (v_DerPreprocessor_7 Int) (v_subst_6 Int) (v_subst_5 Int) (v_subst_3 Int) (v_DerPreprocessor_20 Int) (v_subst_1 Int) (v_ArrVal_178 Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_19 Int)) (let ((.cse36 (store v_arrayElimArr_10 v_subst_5 v_DerPreprocessor_57)) (.cse35 (store (store v_arrayElimArr_10 v_subst_5 v_DerPreprocessor_7) v_subst_3 v_DerPreprocessor_8))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |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_ArrVal_178)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_6) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse7) 0)) (not (= (select .cse35 v_subst_5) v_DerPreprocessor_7)) (not (= v_DerPreprocessor_57 (select (store .cse36 v_subst_1 v_DerPreprocessor_58) v_subst_5))) (not (= v_DerPreprocessor_19 (select (store (store v_arrayElimArr_6 v_subst_5 v_DerPreprocessor_19) v_subst_6 v_DerPreprocessor_20) v_subst_5))) (not (= (select (select (let ((.cse37 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |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_10))) (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|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse7) 0)) (not (= (store (store .cse36 v_subst_1 (select .cse35 v_subst_1)) v_subst_3 v_DerPreprocessor_8) .cse35))))) (= |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_10 (Array Int Int))) (or (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_18 Int) (v_DerPreprocessor_60 Int) (v_subst_5 Int) (v_DerPreprocessor_61 Int) (v_subst_3 Int) (v_subst_1 Int)) (let ((.cse39 (store v_arrayElimArr_10 v_subst_5 v_DerPreprocessor_60)) (.cse38 (store (store v_arrayElimArr_10 v_subst_5 v_DerPreprocessor_17) v_subst_3 v_DerPreprocessor_18))) (or (not (= v_DerPreprocessor_17 (select .cse38 v_subst_5))) (not (= v_DerPreprocessor_60 (select (store .cse39 v_subst_1 v_DerPreprocessor_61) v_subst_5))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_33 Int) (v_ArrVal_178 Int) (v_DerPreprocessor_34 Int) (v_DerPreprocessor_26 Int) (v_DerPreprocessor_27 Int) (v_subst_4 Int)) (let ((.cse40 (store (store v_arrayElimArr_6 v_subst_4 v_DerPreprocessor_33) v_subst_5 v_DerPreprocessor_34))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |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_ArrVal_178)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_6) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse7) 0)) (not (= .cse40 (store v_arrayElimArr_6 v_subst_5 v_DerPreprocessor_34))) (not (= v_DerPreprocessor_33 (select .cse40 v_subst_4))) (not (= v_DerPreprocessor_26 (select (store (store v_arrayElimArr_6 v_subst_5 v_DerPreprocessor_26) v_subst_4 v_DerPreprocessor_27) v_subst_5)))))) (not (= (store (store .cse39 v_subst_1 (select .cse38 v_subst_1)) v_subst_3 v_DerPreprocessor_18) .cse38))))) (not (= (select (select (let ((.cse41 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |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_10))) (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_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse7) 0)))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 0))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_178 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |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_ArrVal_178)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_6) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse7) 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_10 (Array Int Int)) (v_DerPreprocessor_69 Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_71 Int) (v_DerPreprocessor_7 Int) (v_subst_5 Int) (v_subst_4 Int) (v_DerPreprocessor_70 Int) (v_subst_3 Int) (v_subst_1 Int)) (let ((.cse42 (store (store (store v_arrayElimArr_10 v_subst_4 v_DerPreprocessor_69) v_subst_5 v_DerPreprocessor_70) v_subst_1 v_DerPreprocessor_71))) (let ((.cse44 (store v_arrayElimArr_10 v_subst_4 (select .cse42 v_subst_4)))) (let ((.cse43 (store (store .cse44 v_subst_5 v_DerPreprocessor_7) v_subst_3 v_DerPreprocessor_8))) (or (not (= (select .cse42 v_subst_5) v_DerPreprocessor_70)) (= v_subst_4 v_subst_1) (not (= v_DerPreprocessor_7 (select .cse43 v_subst_5))) (not (= (store .cse44 v_subst_1 v_DerPreprocessor_71) .cse42)) (not (= (select (select (let ((.cse45 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |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_10))) (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|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse7) 0)) (not (= .cse43 (store (store v_arrayElimArr_10 v_subst_4 (select .cse43 v_subst_4)) v_subst_3 v_DerPreprocessor_8))) (= v_subst_5 v_subst_4)))))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (forall ((v_ArrVal_178 Int) (v_arrayElimArr_4 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |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_ArrVal_178)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_4) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse10) 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_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_DerPreprocessor_47 Int) (v_DerPreprocessor_48 Int) (v_DerPreprocessor_49 Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_7 Int) (v_subst_5 Int) (v_subst_4 Int) (v_subst_3 Int) (v_subst_1 Int)) (let ((.cse47 (store (store (store v_arrayElimArr_10 v_subst_4 v_DerPreprocessor_47) v_subst_5 v_DerPreprocessor_48) v_subst_1 v_DerPreprocessor_49))) (let ((.cse46 (store v_arrayElimArr_10 v_subst_4 (select .cse47 v_subst_4)))) (let ((.cse48 (store (store .cse46 v_subst_5 v_DerPreprocessor_7) v_subst_3 v_DerPreprocessor_8))) (or (not (= (store .cse46 v_subst_1 v_DerPreprocessor_49) .cse47)) (not (= (store (store v_arrayElimArr_10 v_subst_4 (select .cse48 v_subst_4)) v_subst_3 v_DerPreprocessor_8) .cse48)) (= v_subst_4 v_subst_1) (not (= (select .cse48 v_subst_5) v_DerPreprocessor_7)) (not (= (select (select (let ((.cse49 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |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_10))) (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_20|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse7) 0)) (= v_subst_5 v_subst_4) (not (= v_DerPreprocessor_48 (select .cse47 v_subst_5)))))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_178 Int)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |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_ArrVal_178)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_6) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse7) 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))))) is different from false [2024-11-14 04:21:25,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:21:25,168 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 31 treesize of output 42 [2024-11-14 04:21:25,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:21:25,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 57 [2024-11-14 04:21:25,288 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 36 treesize of output 32 [2024-11-14 04:21:25,489 INFO L349 Elim1Store]: treesize reduction 90, result has 44.8 percent of original size [2024-11-14 04:21:25,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 120 treesize of output 151 [2024-11-14 04:21:25,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:21:25,535 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 265 treesize of output 235 [2024-11-14 04:21:26,173 INFO L349 Elim1Store]: treesize reduction 462, result has 21.8 percent of original size [2024-11-14 04:21:26,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 287 treesize of output 455 [2024-11-14 04:21:27,479 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:21:27,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:21:27,865 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 155 treesize of output 161 [2024-11-14 04:21:28,380 INFO L349 Elim1Store]: treesize reduction 48, result has 26.2 percent of original size [2024-11-14 04:21:28,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 494 treesize of output 479 [2024-11-14 04:21:28,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:21:28,669 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 38 treesize of output 42 [2024-11-14 04:21:28,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:21:28,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:21:28,730 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:21:28,743 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:21:28,751 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:21:28,752 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:21:28,761 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 27 treesize of output 23 [2024-11-14 04:21:28,769 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:21:28,776 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:21:28,777 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:21:28,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:21:28,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 40 [2024-11-14 04:21:28,850 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:21:28,865 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:21:28,876 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:21:28,889 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:21:28,904 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:21:28,914 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:21:28,915 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:21:28,954 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:21:28,955 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:21:28,969 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:21:28,980 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:21:28,989 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:21:28,998 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:21:29,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:21:29,004 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:21:29,005 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:21:29,010 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:21:29,010 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:21:29,023 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:21:29,041 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:21:29,050 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:21:29,051 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:21:29,056 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:21:29,057 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:21:29,063 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:21:29,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:21:29,072 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:21:29,073 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:21:29,081 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:21:29,082 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:21:29,093 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:21:29,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:21:29,107 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:21:29,108 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:21:29,113 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:21:29,113 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:21:29,259 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:21:29,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963038656] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:21:29,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1680541840] [2024-11-14 04:21:29,283 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-14 04:21:29,283 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:21:29,287 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:21:29,292 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:21:29,292 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:21:31,520 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 84 for LOIs [2024-11-14 04:21:31,622 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 13 for LOIs [2024-11-14 04:21:31,625 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 95 for LOIs [2024-11-14 04:21:31,637 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:21:34,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1680541840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:21:34,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:21:34,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5, 10, 9] total 32 [2024-11-14 04:21:34,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144711400] [2024-11-14 04:21:34,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:21:34,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 04:21:34,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:21:34,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 04:21:34,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=835, Unknown=2, NotChecked=58, Total=992 [2024-11-14 04:21:34,777 INFO L87 Difference]: Start difference. First operand 77 states and 102 transitions. Second operand has 13 states, 10 states have (on average 1.5) 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:21:38,317 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:21:40,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:21:40,338 INFO L93 Difference]: Finished difference Result 137 states and 181 transitions. [2024-11-14 04:21:40,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 04:21:40,340 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 1.5) 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:21:40,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:21:40,343 INFO L225 Difference]: With dead ends: 137 [2024-11-14 04:21:40,343 INFO L226 Difference]: Without dead ends: 103 [2024-11-14 04:21:40,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 77 SyntacticMatches, 10 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=132, Invalid=1130, Unknown=2, NotChecked=68, Total=1332 [2024-11-14 04:21:40,346 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 20 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:21:40,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 195 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 341 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2024-11-14 04:21:40,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-14 04:21:40,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-14 04:21:40,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 66 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:21:40,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 136 transitions. [2024-11-14 04:21:40,385 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 136 transitions. Word has length 38 [2024-11-14 04:21:40,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:21:40,385 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 136 transitions. [2024-11-14 04:21:40,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 1.5) 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:21:40,386 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 136 transitions. [2024-11-14 04:21:40,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-14 04:21:40,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:21:40,388 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:21:40,414 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 04:21:40,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:21:40,589 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:21:40,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:21:40,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1616485300, now seen corresponding path program 1 times [2024-11-14 04:21:40,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:21:40,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357053939] [2024-11-14 04:21:40,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:21:40,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:21:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:21:40,914 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:21:40,914 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:21:40,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357053939] [2024-11-14 04:21:40,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357053939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:21:40,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745222643] [2024-11-14 04:21:40,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:21:40,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:21:40,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:21:40,918 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:21:40,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 04:21:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:21:41,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 04:21:41,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:21:41,285 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:21:41,285 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:21:41,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745222643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:21:41,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:21:41,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-11-14 04:21:41,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73572909] [2024-11-14 04:21:41,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:21:41,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:21:41,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:21:41,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:21:41,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-14 04:21:41,288 INFO L87 Difference]: Start difference. First operand 103 states and 136 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:21:41,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:21:41,459 INFO L93 Difference]: Finished difference Result 215 states and 282 transitions. [2024-11-14 04:21:41,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:21:41,459 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:21:41,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:21:41,461 INFO L225 Difference]: With dead ends: 215 [2024-11-14 04:21:41,461 INFO L226 Difference]: Without dead ends: 119 [2024-11-14 04:21:41,463 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:21:41,463 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 13 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 168 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.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:21:41,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 168 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:21:41,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-14 04:21:41,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 103. [2024-11-14 04:21:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 66 states have internal predecessors, (83), 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:21:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 134 transitions. [2024-11-14 04:21:41,504 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 134 transitions. Word has length 40 [2024-11-14 04:21:41,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:21:41,504 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 134 transitions. [2024-11-14 04:21:41,504 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:21:41,505 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 134 transitions. [2024-11-14 04:21:41,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-14 04:21:41,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:21:41,507 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:21:41,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 04:21:41,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:21:41,708 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:21:41,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:21:41,708 INFO L85 PathProgramCache]: Analyzing trace with hash 404425297, now seen corresponding path program 1 times [2024-11-14 04:21:41,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:21:41,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226629809] [2024-11-14 04:21:41,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:21:41,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:21:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:21:42,077 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:21:42,078 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:21:42,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226629809] [2024-11-14 04:21:42,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226629809] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:21:42,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326799662] [2024-11-14 04:21:42,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:21:42,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:21:42,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:21:42,081 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:21:42,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 04:21:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:21:42,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 04:21:42,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:21:42,472 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:21:42,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:21:42,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326799662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:21:42,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:21:42,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2024-11-14 04:21:42,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155161691] [2024-11-14 04:21:42,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:21:42,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 04:21:42,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:21:42,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 04:21:42,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-14 04:21:42,475 INFO L87 Difference]: Start difference. First operand 103 states and 134 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:21:42,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:21:42,768 INFO L93 Difference]: Finished difference Result 241 states and 320 transitions. [2024-11-14 04:21:42,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 04:21:42,769 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:21:42,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:21:42,771 INFO L225 Difference]: With dead ends: 241 [2024-11-14 04:21:42,772 INFO L226 Difference]: Without dead ends: 143 [2024-11-14 04:21:42,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-14 04:21:42,774 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 22 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 194 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:21:42,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 194 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:21:42,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-14 04:21:42,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 105. [2024-11-14 04:21:42,804 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:21:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2024-11-14 04:21:42,807 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 42 [2024-11-14 04:21:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:21:42,807 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 136 transitions. [2024-11-14 04:21:42,807 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:21:42,807 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 136 transitions. [2024-11-14 04:21:42,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-14 04:21:42,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:21:42,809 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:21:42,831 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 04:21:43,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:21:43,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:21:43,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:21:43,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1598164960, now seen corresponding path program 1 times [2024-11-14 04:21:43,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:21:43,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743773119] [2024-11-14 04:21:43,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:21:43,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:21:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:21:43,428 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:21:43,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:21:43,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743773119] [2024-11-14 04:21:43,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743773119] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:21:43,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508710425] [2024-11-14 04:21:43,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:21:43,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:21:43,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:21:43,431 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:21:43,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 04:21:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:21:43,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 04:21:43,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:21:43,771 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:21:43,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:21:43,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508710425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:21:43,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:21:43,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-14 04:21:43,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749160352] [2024-11-14 04:21:43,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:21:43,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:21:43,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:21:43,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:21:43,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:21:43,774 INFO L87 Difference]: Start difference. First operand 105 states and 136 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:21:43,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:21:43,882 INFO L93 Difference]: Finished difference Result 215 states and 295 transitions. [2024-11-14 04:21:43,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:21:43,883 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:21:43,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:21:43,885 INFO L225 Difference]: With dead ends: 215 [2024-11-14 04:21:43,885 INFO L226 Difference]: Without dead ends: 123 [2024-11-14 04:21:43,886 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:21:43,887 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 85 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:21:43,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 85 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:21:43,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-14 04:21:43,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 111. [2024-11-14 04:21:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 74 states have internal predecessors, (93), 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:21:43,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 144 transitions. [2024-11-14 04:21:43,929 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 144 transitions. Word has length 43 [2024-11-14 04:21:43,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:21:43,930 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 144 transitions. [2024-11-14 04:21:43,930 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:21:43,930 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 144 transitions. [2024-11-14 04:21:43,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-14 04:21:43,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:21:43,932 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:21:43,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-14 04:21:44,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:21:44,134 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:21:44,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:21:44,135 INFO L85 PathProgramCache]: Analyzing trace with hash 409811884, now seen corresponding path program 1 times [2024-11-14 04:21:44,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:21:44,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258569041] [2024-11-14 04:21:44,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:21:44,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:21:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:21:44,570 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:21:44,570 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:21:44,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258569041] [2024-11-14 04:21:44,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258569041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:21:44,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415188229] [2024-11-14 04:21:44,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:21:44,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:21:44,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:21:44,573 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:21:44,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2d0bd0b-3796-4dcf-b4b0-6ba145d10a73/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 04:21:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:21:44,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-14 04:21:44,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:21:45,011 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:21:45,035 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:21:45,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:21:45,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:21:45,132 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:21:45,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:21:45,141 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:21:45,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:21:45,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:21:45,164 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:21:45,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:21:45,176 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:21:45,394 INFO L349 Elim1Store]: treesize reduction 141, result has 15.6 percent of original size [2024-11-14 04:21:45,395 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 170 treesize of output 87 [2024-11-14 04:21:45,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:21:45,407 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 93 treesize of output 35 [2024-11-14 04:21:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 04:21:58,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:22:42,832 WARN L286 SmtUtils]: Spent 34.74s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 04:22:42,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:22:42,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 8 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 1529 treesize of output 1874 [2024-11-14 04:22:43,088 INFO L224 Elim1Store]: Index analysis took 190 ms [2024-11-14 04:23:19,212 WARN L286 SmtUtils]: Spent 36.12s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 04:23:19,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:23:19,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 8 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 1433 treesize of output 1778